./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 0ed9222f 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-0ed9222-m [2019-01-14 04:36:56,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:36:56,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:36:56,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:36:56,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:36:56,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:36:56,274 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:36:56,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:36:56,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:36:56,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:36:56,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:36:56,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:36:56,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:36:56,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:36:56,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:36:56,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:36:56,287 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:36:56,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:36:56,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:36:56,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:36:56,295 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:36:56,296 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:36:56,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:36:56,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:36:56,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:36:56,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:36:56,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:36:56,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:36:56,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:36:56,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:36:56,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:36:56,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:36:56,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:36:56,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:36:56,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:36:56,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:36:56,310 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:36:56,355 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:36:56,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:36:56,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:36:56,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:36:56,359 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:36:56,360 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:36:56,362 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:36:56,362 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:36:56,363 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:36:56,363 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:36:56,363 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:36:56,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:36:56,363 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:36:56,364 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:36:56,364 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:36:56,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:36:56,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:36:56,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:36:56,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:36:56,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:36:56,368 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:36:56,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:36:56,369 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:36:56,369 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:36:56,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:36:56,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:36:56,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:36:56,370 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:36:56,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:36:56,371 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:36:56,371 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:36:56,374 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:36:56,375 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 [2019-01-14 04:36:56,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:36:56,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:36:56,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:36:56,498 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:36:56,498 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:36:56,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2019-01-14 04:36:56,571 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d873f712/ef43791d4bb94c54ae3005d35eff98e0/FLAG11b34dacc [2019-01-14 04:36:57,172 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:36:57,172 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2019-01-14 04:36:57,185 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d873f712/ef43791d4bb94c54ae3005d35eff98e0/FLAG11b34dacc [2019-01-14 04:36:57,430 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d873f712/ef43791d4bb94c54ae3005d35eff98e0 [2019-01-14 04:36:57,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:36:57,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:36:57,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:36:57,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:36:57,444 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:36:57,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:57,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531b3ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57, skipping insertion in model container [2019-01-14 04:36:57,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:57,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:36:57,516 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:36:57,872 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:36:57,880 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:36:57,931 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:36:57,960 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:36:57,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57 WrapperNode [2019-01-14 04:36:57,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:36:57,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:36:57,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:36:57,963 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:36:57,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:57,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:58,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:36:58,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:36:58,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:36:58,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:36:58,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:58,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:58,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:58,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:58,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:58,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:58,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (1/1) ... [2019-01-14 04:36:58,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:36:58,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:36:58,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:36:58,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:36:58,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (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 [2019-01-14 04:36:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:36:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:36:59,841 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:36:59,841 INFO L286 CfgBuilder]: Removed 95 assue(true) statements. [2019-01-14 04:36:59,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:36:59 BoogieIcfgContainer [2019-01-14 04:36:59,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:36:59,845 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:36:59,845 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:36:59,850 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:36:59,852 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:36:59,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:36:57" (1/3) ... [2019-01-14 04:36:59,854 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e88d58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:36:59, skipping insertion in model container [2019-01-14 04:36:59,855 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:36:59,855 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:36:57" (2/3) ... [2019-01-14 04:36:59,856 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e88d58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:36:59, skipping insertion in model container [2019-01-14 04:36:59,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:36:59,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:36:59" (3/3) ... [2019-01-14 04:36:59,859 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu2_false-unreach-call_false-termination.cil.c [2019-01-14 04:36:59,933 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:36:59,934 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:36:59,934 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:36:59,934 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:36:59,934 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:36:59,934 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:36:59,934 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:36:59,934 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:36:59,935 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:36:59,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2019-01-14 04:37:00,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2019-01-14 04:37:00,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:00,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:00,018 INFO L867 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] [2019-01-14 04:37:00,019 INFO L868 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] [2019-01-14 04:37:00,019 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:37:00,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2019-01-14 04:37:00,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2019-01-14 04:37:00,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:00,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:00,034 INFO L867 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] [2019-01-14 04:37:00,034 INFO L868 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] [2019-01-14 04:37:00,045 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 [2019-01-14 04:37:00,046 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 [2019-01-14 04:37:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:00,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2019-01-14 04:37:00,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:00,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:00,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:00,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:00,253 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2040352856, now seen corresponding path program 1 times [2019-01-14 04:37:00,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:00,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:00,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:00,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:00,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:00,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:00,276 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:00,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:00,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:00,300 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 3 states. [2019-01-14 04:37:00,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:00,354 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2019-01-14 04:37:00,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:00,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 257 transitions. [2019-01-14 04:37:00,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2019-01-14 04:37:00,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 167 states and 249 transitions. [2019-01-14 04:37:00,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-01-14 04:37:00,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-01-14 04:37:00,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 249 transitions. [2019-01-14 04:37:00,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:00,380 INFO L706 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2019-01-14 04:37:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 249 transitions. [2019-01-14 04:37:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-14 04:37:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-14 04:37:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 249 transitions. [2019-01-14 04:37:00,437 INFO L729 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2019-01-14 04:37:00,437 INFO L609 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2019-01-14 04:37:00,438 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:37:00,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 249 transitions. [2019-01-14 04:37:00,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2019-01-14 04:37:00,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:00,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:00,444 INFO L867 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] [2019-01-14 04:37:00,444 INFO L868 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] [2019-01-14 04:37:00,445 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 [2019-01-14 04:37:00,446 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 [2019-01-14 04:37:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:00,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2019-01-14 04:37:00,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:00,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:00,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:00,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:00,493 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:00,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:00,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 1 times [2019-01-14 04:37:00,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:00,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:00,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:00,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:00,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:00,826 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:00,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:00,828 INFO L87 Difference]: Start difference. First operand 167 states and 249 transitions. cyclomatic complexity: 83 Second operand 3 states. [2019-01-14 04:37:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:00,886 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2019-01-14 04:37:00,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:00,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 248 transitions. [2019-01-14 04:37:00,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2019-01-14 04:37:00,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 248 transitions. [2019-01-14 04:37:00,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-01-14 04:37:00,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-01-14 04:37:00,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 248 transitions. [2019-01-14 04:37:00,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:00,915 INFO L706 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2019-01-14 04:37:00,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 248 transitions. [2019-01-14 04:37:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-14 04:37:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-14 04:37:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 248 transitions. [2019-01-14 04:37:00,936 INFO L729 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2019-01-14 04:37:00,937 INFO L609 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2019-01-14 04:37:00,937 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:37:00,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 248 transitions. [2019-01-14 04:37:00,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2019-01-14 04:37:00,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:00,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:00,947 INFO L867 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] [2019-01-14 04:37:00,948 INFO L868 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] [2019-01-14 04:37:00,949 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 [2019-01-14 04:37:00,949 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 [2019-01-14 04:37:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2019-01-14 04:37:00,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:00,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:00,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:00,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:01,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:01,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:01,048 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:01,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 2 times [2019-01-14 04:37:01,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:01,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:01,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:01,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:01,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:01,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:01,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:01,170 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:01,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:01,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:01,173 INFO L87 Difference]: Start difference. First operand 167 states and 248 transitions. cyclomatic complexity: 82 Second operand 3 states. [2019-01-14 04:37:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:01,329 INFO L93 Difference]: Finished difference Result 301 states and 442 transitions. [2019-01-14 04:37:01,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:01,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 442 transitions. [2019-01-14 04:37:01,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 273 [2019-01-14 04:37:01,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 301 states and 442 transitions. [2019-01-14 04:37:01,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 301 [2019-01-14 04:37:01,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 301 [2019-01-14 04:37:01,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 301 states and 442 transitions. [2019-01-14 04:37:01,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:01,343 INFO L706 BuchiCegarLoop]: Abstraction has 301 states and 442 transitions. [2019-01-14 04:37:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states and 442 transitions. [2019-01-14 04:37:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 286. [2019-01-14 04:37:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-14 04:37:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 421 transitions. [2019-01-14 04:37:01,362 INFO L729 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2019-01-14 04:37:01,362 INFO L609 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2019-01-14 04:37:01,362 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:37:01,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 286 states and 421 transitions. [2019-01-14 04:37:01,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 258 [2019-01-14 04:37:01,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:01,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:01,367 INFO L867 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] [2019-01-14 04:37:01,367 INFO L868 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] [2019-01-14 04:37:01,368 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 [2019-01-14 04:37:01,368 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 [2019-01-14 04:37:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2019-01-14 04:37:01,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:01,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:01,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:01,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:01,460 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:01,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:01,461 INFO L82 PathProgramCache]: Analyzing trace with hash 481737154, now seen corresponding path program 1 times [2019-01-14 04:37:01,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:01,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:01,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:01,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:01,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:01,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:01,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:01,550 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:01,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:01,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:01,552 INFO L87 Difference]: Start difference. First operand 286 states and 421 transitions. cyclomatic complexity: 136 Second operand 3 states. [2019-01-14 04:37:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:02,031 INFO L93 Difference]: Finished difference Result 532 states and 764 transitions. [2019-01-14 04:37:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:02,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 764 transitions. [2019-01-14 04:37:02,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 506 [2019-01-14 04:37:02,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 532 states and 764 transitions. [2019-01-14 04:37:02,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2019-01-14 04:37:02,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2019-01-14 04:37:02,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 764 transitions. [2019-01-14 04:37:02,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:02,068 INFO L706 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2019-01-14 04:37:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 764 transitions. [2019-01-14 04:37:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 516. [2019-01-14 04:37:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-01-14 04:37:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 744 transitions. [2019-01-14 04:37:02,114 INFO L729 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2019-01-14 04:37:02,115 INFO L609 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2019-01-14 04:37:02,115 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:37:02,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 744 transitions. [2019-01-14 04:37:02,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 490 [2019-01-14 04:37:02,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:02,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:02,122 INFO L867 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] [2019-01-14 04:37:02,122 INFO L868 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] [2019-01-14 04:37:02,122 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 [2019-01-14 04:37:02,123 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 [2019-01-14 04:37:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2019-01-14 04:37:02,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:02,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:02,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:02,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:02,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash 290270835, now seen corresponding path program 1 times [2019-01-14 04:37:02,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:02,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:02,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:02,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:02,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:02,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:02,352 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:02,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:02,353 INFO L87 Difference]: Start difference. First operand 516 states and 744 transitions. cyclomatic complexity: 229 Second operand 5 states. [2019-01-14 04:37:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:03,056 INFO L93 Difference]: Finished difference Result 908 states and 1298 transitions. [2019-01-14 04:37:03,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:37:03,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 908 states and 1298 transitions. [2019-01-14 04:37:03,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 882 [2019-01-14 04:37:03,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 908 states to 908 states and 1298 transitions. [2019-01-14 04:37:03,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 908 [2019-01-14 04:37:03,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 908 [2019-01-14 04:37:03,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 908 states and 1298 transitions. [2019-01-14 04:37:03,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:03,092 INFO L706 BuchiCegarLoop]: Abstraction has 908 states and 1298 transitions. [2019-01-14 04:37:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states and 1298 transitions. [2019-01-14 04:37:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 528. [2019-01-14 04:37:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-01-14 04:37:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 756 transitions. [2019-01-14 04:37:03,120 INFO L729 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2019-01-14 04:37:03,120 INFO L609 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2019-01-14 04:37:03,120 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:37:03,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 756 transitions. [2019-01-14 04:37:03,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 502 [2019-01-14 04:37:03,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:03,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:03,131 INFO L867 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] [2019-01-14 04:37:03,131 INFO L868 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] [2019-01-14 04:37:03,132 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 [2019-01-14 04:37:03,133 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 [2019-01-14 04:37:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2019-01-14 04:37:03,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:03,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:03,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:03,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:03,175 INFO L82 PathProgramCache]: Analyzing trace with hash -303364692, now seen corresponding path program 1 times [2019-01-14 04:37:03,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:03,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:03,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:03,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:03,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:03,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:03,258 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:03,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:03,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:03,260 INFO L87 Difference]: Start difference. First operand 528 states and 756 transitions. cyclomatic complexity: 229 Second operand 3 states. [2019-01-14 04:37:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:03,581 INFO L93 Difference]: Finished difference Result 922 states and 1296 transitions. [2019-01-14 04:37:03,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:03,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 922 states and 1296 transitions. [2019-01-14 04:37:03,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2019-01-14 04:37:03,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 922 states to 922 states and 1296 transitions. [2019-01-14 04:37:03,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 922 [2019-01-14 04:37:03,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 922 [2019-01-14 04:37:03,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 922 states and 1296 transitions. [2019-01-14 04:37:03,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:03,609 INFO L706 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2019-01-14 04:37:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states and 1296 transitions. [2019-01-14 04:37:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2019-01-14 04:37:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-01-14 04:37:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1296 transitions. [2019-01-14 04:37:03,637 INFO L729 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2019-01-14 04:37:03,637 INFO L609 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2019-01-14 04:37:03,637 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:37:03,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 922 states and 1296 transitions. [2019-01-14 04:37:03,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2019-01-14 04:37:03,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:03,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:03,650 INFO L867 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] [2019-01-14 04:37:03,651 INFO L868 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] [2019-01-14 04:37:03,651 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 [2019-01-14 04:37:03,651 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 [2019-01-14 04:37:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2019-01-14 04:37:03,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:03,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:03,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:03,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:03,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2068374570, now seen corresponding path program 1 times [2019-01-14 04:37:03,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:03,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:03,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:03,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:03,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:03,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:03,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:03,835 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:03,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:03,838 INFO L87 Difference]: Start difference. First operand 922 states and 1296 transitions. cyclomatic complexity: 375 Second operand 5 states. [2019-01-14 04:37:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:04,490 INFO L93 Difference]: Finished difference Result 2050 states and 2879 transitions. [2019-01-14 04:37:04,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:37:04,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 2879 transitions. [2019-01-14 04:37:04,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2024 [2019-01-14 04:37:04,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 2879 transitions. [2019-01-14 04:37:04,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2019-01-14 04:37:04,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2019-01-14 04:37:04,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 2879 transitions. [2019-01-14 04:37:04,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:04,568 INFO L706 BuchiCegarLoop]: Abstraction has 2050 states and 2879 transitions. [2019-01-14 04:37:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 2879 transitions. [2019-01-14 04:37:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 958. [2019-01-14 04:37:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-01-14 04:37:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1323 transitions. [2019-01-14 04:37:04,619 INFO L729 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2019-01-14 04:37:04,619 INFO L609 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2019-01-14 04:37:04,621 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:37:04,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 958 states and 1323 transitions. [2019-01-14 04:37:04,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 932 [2019-01-14 04:37:04,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:04,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:04,640 INFO L867 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] [2019-01-14 04:37:04,641 INFO L868 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] [2019-01-14 04:37:04,642 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 [2019-01-14 04:37:04,642 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 [2019-01-14 04:37:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:04,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 4 times [2019-01-14 04:37:04,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:04,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:04,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1803890900, now seen corresponding path program 1 times [2019-01-14 04:37:04,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:04,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:04,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:04,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:04,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:05,312 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-01-14 04:37:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:05,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:05,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:05,318 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:05,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:05,323 INFO L87 Difference]: Start difference. First operand 958 states and 1323 transitions. cyclomatic complexity: 366 Second operand 5 states. [2019-01-14 04:37:05,590 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:37:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:06,069 INFO L93 Difference]: Finished difference Result 2024 states and 2800 transitions. [2019-01-14 04:37:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:37:06,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2024 states and 2800 transitions. [2019-01-14 04:37:06,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1998 [2019-01-14 04:37:06,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2024 states to 2024 states and 2800 transitions. [2019-01-14 04:37:06,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2024 [2019-01-14 04:37:06,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2024 [2019-01-14 04:37:06,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2024 states and 2800 transitions. [2019-01-14 04:37:06,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:06,117 INFO L706 BuchiCegarLoop]: Abstraction has 2024 states and 2800 transitions. [2019-01-14 04:37:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states and 2800 transitions. [2019-01-14 04:37:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 988. [2019-01-14 04:37:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-01-14 04:37:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1342 transitions. [2019-01-14 04:37:06,157 INFO L729 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2019-01-14 04:37:06,157 INFO L609 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2019-01-14 04:37:06,157 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:37:06,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1342 transitions. [2019-01-14 04:37:06,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2019-01-14 04:37:06,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:06,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:06,165 INFO L867 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] [2019-01-14 04:37:06,165 INFO L868 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] [2019-01-14 04:37:06,166 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 [2019-01-14 04:37:06,166 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 [2019-01-14 04:37:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 5 times [2019-01-14 04:37:06,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:06,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1479959146, now seen corresponding path program 1 times [2019-01-14 04:37:06,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:06,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:06,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:06,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:06,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:06,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1057551404, now seen corresponding path program 1 times [2019-01-14 04:37:06,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:06,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:06,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:06,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:06,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:06,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:06,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:06,971 WARN L181 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-01-14 04:37:07,106 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-14 04:37:07,120 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:07,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:07,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:07,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:07,122 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:37:07,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:07,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:07,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:07,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2019-01-14 04:37:07,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:07,123 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:07,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:07,789 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:07,792 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 [2019-01-14 04:37:07,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:07,799 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:07,810 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:07,810 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 [2019-01-14 04:37:07,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:07,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:07,865 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:07,866 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) [2019-01-14 04:37:07,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:07,916 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:07,956 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:07,956 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) [2019-01-14 04:37:08,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,016 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:08,042 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,042 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) [2019-01-14 04:37:08,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,138 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:08,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,152 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 [2019-01-14 04:37:08,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,192 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,196 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,196 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 [2019-01-14 04:37:08,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,230 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,231 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 [2019-01-14 04:37:08,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,270 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,270 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 [2019-01-14 04:37:08,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,303 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,303 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 [2019-01-14 04:37:08,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,335 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,335 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 [2019-01-14 04:37:08,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,367 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,367 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 [2019-01-14 04:37:08,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,396 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 [2019-01-14 04:37:08,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,426 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,426 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 [2019-01-14 04:37:08,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,456 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,457 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 [2019-01-14 04:37:08,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,487 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,487 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 [2019-01-14 04:37:08,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,515 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,532 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,533 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 [2019-01-14 04:37:08,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,574 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,574 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 [2019-01-14 04:37:08,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:08,605 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 [2019-01-14 04:37:08,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:08,634 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 [2019-01-14 04:37:08,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:37:08,679 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:08,739 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:37:08,744 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:08,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:08,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:08,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:08,745 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:37:08,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:08,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:08,745 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:08,745 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2019-01-14 04:37:08,745 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:08,745 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:08,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:08,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:09,799 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:37:10,388 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:10,394 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:37:10,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,503 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:10,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,585 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,586 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:10,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,590 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,591 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:10,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,616 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:10,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,623 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,624 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:10,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:10,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:10,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,685 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 04:37:10,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,689 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,689 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,692 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,693 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,710 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,710 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,719 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,719 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,736 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,754 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,754 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,763 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,764 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,772 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,775 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:10,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,786 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,790 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,796 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,797 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,804 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,804 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,813 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,814 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,825 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,826 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,832 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,833 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,843 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,844 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,850 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,851 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,860 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,860 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:10,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,873 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,873 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:10,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,886 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,887 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,897 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,897 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,903 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,909 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:10,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,913 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:10,913 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:10,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,919 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,920 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,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 [2019-01-14 04:37:10,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,933 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,933 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,939 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,940 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,953 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,954 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,973 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,974 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,988 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:10,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:10,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:10,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:10,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:10,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:10,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:10,991 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:10,995 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:10,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,010 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,010 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,012 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 04:37:11,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,014 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,014 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,024 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,025 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,037 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,048 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,065 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,076 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,084 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,091 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,091 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,102 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,102 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,103 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:11,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,110 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,111 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,121 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,121 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,129 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,133 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,140 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,144 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,151 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,154 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,157 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,158 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,165 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,166 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,171 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,172 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,176 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,176 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,177 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:11,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,182 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,182 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,183 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:11,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,193 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,193 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,198 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,199 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,202 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,202 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,203 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:11,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,207 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,207 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,208 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:11,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,213 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,214 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,224 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,224 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,230 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,231 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,238 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,239 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,244 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,246 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,251 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,252 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,256 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,257 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,263 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:11,264 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:11,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,269 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 04:37:11,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,276 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,277 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,284 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,285 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,298 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,298 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,310 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,311 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,323 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,324 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,345 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,346 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,350 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,351 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,355 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,355 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,360 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,360 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,361 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:11,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,372 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,372 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,384 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,385 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,390 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,391 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,397 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,398 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,408 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,410 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,419 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,420 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,429 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,430 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,443 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,444 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,450 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,450 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,451 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:11,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,463 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,463 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,464 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:11,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,497 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,498 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,507 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,511 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,519 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,520 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,523 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:11,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,532 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,532 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,532 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:11,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,543 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,544 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,555 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,556 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,567 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,568 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,588 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,589 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,603 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,604 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,616 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,621 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,628 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,628 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:11,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,644 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:11,645 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:11,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,649 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 04:37:11,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,654 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,656 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,661 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,663 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,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 [2019-01-14 04:37:11,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,674 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,675 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,675 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,680 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,680 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,681 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,713 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,714 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,715 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,744 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,746 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,747 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,756 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,757 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,758 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,776 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,777 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,785 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,785 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:11,786 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:11,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,796 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,797 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,798 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,957 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,957 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,958 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,971 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,971 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,972 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,973 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:11,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:11,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:11,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:11,983 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:11,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:11,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:11,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:11,991 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:11,992 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:11,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,003 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,011 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,011 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,036 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,041 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,041 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,050 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,051 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,051 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,077 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,077 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,088 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,089 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:12,090 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:12,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,108 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,109 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:12,111 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:12,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,140 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,141 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,142 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,150 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,151 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,151 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,164 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,164 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:12,164 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:12,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,182 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,186 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:12,186 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:12,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,204 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,211 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,211 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,225 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,225 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,229 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,230 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,238 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,239 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,239 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,244 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,267 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,267 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,268 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,269 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,289 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,290 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,296 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,296 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,300 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,301 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,305 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,308 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,309 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,324 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,325 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:12,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,325 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:12,326 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:12,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,328 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 04:37:12,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,330 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,330 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,330 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,331 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,335 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,336 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,336 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,337 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,346 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,346 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,348 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,349 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,354 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,355 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,356 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,362 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,362 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,363 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,365 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,379 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,379 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,380 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,416 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,417 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,417 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,423 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,423 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,424 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,436 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,436 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,437 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:12,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,442 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:12,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,481 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,482 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,483 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,489 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,490 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,491 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,502 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,503 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,553 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,554 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,555 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,562 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,562 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,563 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,564 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,576 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,576 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,580 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,630 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,631 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,632 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,638 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,639 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,640 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,647 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,647 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,648 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:12,648 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,650 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:12,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,720 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,721 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:12,721 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,723 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:12,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,754 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,755 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,755 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,772 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,772 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,773 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,774 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,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 [2019-01-14 04:37:12,806 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,807 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,807 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:12,807 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,809 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:12,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,829 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,829 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,830 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:12,830 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,837 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:12,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,848 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,848 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,850 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,882 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,882 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,883 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,890 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,891 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,922 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,927 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,928 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,964 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,965 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,966 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,974 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,975 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,976 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:12,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:12,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:12,984 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:12,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:12,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:12,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:12,984 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:12,988 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:12,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:12,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,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 [2019-01-14 04:37:13,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,041 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:13,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,041 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:13,042 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:13,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,045 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 04:37:13,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,049 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,050 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,050 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,054 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,059 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,060 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,064 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,120 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,121 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,123 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,126 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,134 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,146 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,146 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,152 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,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 [2019-01-14 04:37:13,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,217 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,218 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,219 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,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 [2019-01-14 04:37:13,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,224 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,225 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,226 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,235 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,235 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,238 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,241 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,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 [2019-01-14 04:37:13,303 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,303 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,304 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:13,304 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,307 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:13,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,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 [2019-01-14 04:37:13,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,340 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,341 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,345 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,358 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,359 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,361 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,417 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,418 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,420 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,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 [2019-01-14 04:37:13,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,432 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,433 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,434 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,447 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,448 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,452 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,510 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,511 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,512 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,513 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,520 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,520 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,525 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,526 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,536 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,536 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,536 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,543 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,600 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,601 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:13,601 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,607 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:13,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,632 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,633 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:13,633 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,635 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:13,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,653 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,654 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,708 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,709 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,711 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,721 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,724 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,725 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:13,725 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,727 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:13,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,742 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,751 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:13,751 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,755 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:13,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,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 [2019-01-14 04:37:13,821 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,821 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,823 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,846 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,847 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,853 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,864 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,865 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,870 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,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 [2019-01-14 04:37:13,925 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,927 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,927 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,929 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,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 [2019-01-14 04:37:13,948 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,951 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,952 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,956 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:13,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:13,977 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:13,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:13,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:13,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:13,978 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:13,979 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:13,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:13,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:13,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,037 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:14,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,038 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:14,042 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:14,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,052 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:14,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,053 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:14,054 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:14,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,057 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 04:37:14,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,058 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,058 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,060 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,061 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,126 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,127 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,127 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,138 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,139 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,140 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,151 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,151 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,157 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,221 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,222 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,223 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,244 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,244 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,244 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,245 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,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 [2019-01-14 04:37:14,249 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,249 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,250 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,250 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,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 [2019-01-14 04:37:14,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,321 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,321 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,322 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,327 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,327 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,328 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:14,328 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,328 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:14,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,340 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,344 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,344 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,400 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,400 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,402 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,408 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,409 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,411 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,426 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,426 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,427 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,427 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,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 [2019-01-14 04:37:14,492 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,493 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,494 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,494 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,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 [2019-01-14 04:37:14,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,502 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,503 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,503 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,516 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,516 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,517 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,584 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,585 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,585 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,586 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,593 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,593 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:14,593 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,597 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:14,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,614 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,614 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,617 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:14,617 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,618 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:14,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,706 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,709 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,716 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,723 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,724 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,731 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,731 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:14,732 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,736 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:14,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,803 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,804 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,804 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:14,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,805 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:14,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,810 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,818 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,819 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,819 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,820 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,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 [2019-01-14 04:37:14,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,890 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,891 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,916 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,917 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,917 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:14,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,934 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,935 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:14,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:14,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 [2019-01-14 04:37:14,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:14,997 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:14,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:14,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:14,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:14,998 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:14,999 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:14,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,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 [2019-01-14 04:37:15,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,003 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:15,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:15,006 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:15,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,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 [2019-01-14 04:37:15,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,017 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:15,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,018 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:15,018 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:15,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,026 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 04:37:15,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,094 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,100 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,102 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,103 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,134 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,134 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,191 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,191 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,192 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,201 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,202 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,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 [2019-01-14 04:37:15,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,247 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,247 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,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 [2019-01-14 04:37:15,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,301 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,302 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,311 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,311 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,324 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,324 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,327 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:15,327 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,328 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:15,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,393 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,393 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,404 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,404 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,405 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,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 [2019-01-14 04:37:15,433 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,434 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,435 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,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 [2019-01-14 04:37:15,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,478 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,478 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,490 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,490 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,491 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,506 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,506 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,507 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,580 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,580 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,581 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,593 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,594 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,613 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:15,613 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,614 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:15,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,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 [2019-01-14 04:37:15,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,663 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,663 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:15,663 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,665 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:15,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,703 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,705 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,706 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,723 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,724 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,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 [2019-01-14 04:37:15,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,777 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,778 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:15,778 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,779 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:15,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,791 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,791 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:15,791 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,792 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:15,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,812 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,889 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,889 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,901 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,901 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,902 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:15,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:15,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:15,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:15,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:15,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:15,961 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:15,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:15,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:15,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:15,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:16,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:16,020 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:16,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:16,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:16,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:16,022 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:16,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:16,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:16,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:16,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 [2019-01-14 04:37:16,033 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:16,033 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:16,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:16,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:16,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:16,033 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:16,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:16,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:16,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:16,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:16,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:16,042 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:16,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:16,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:16,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:16,042 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:16,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:16,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:16,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:16,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:16,121 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:16,121 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:16,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:16,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:16,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:16,122 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:16,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:16,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:16,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:16,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:16,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:16,138 INFO L87 Difference]: Start difference. First operand 988 states and 1342 transitions. cyclomatic complexity: 355 Second operand 3 states. [2019-01-14 04:37:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:16,603 INFO L93 Difference]: Finished difference Result 988 states and 1326 transitions. [2019-01-14 04:37:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:16,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 988 states and 1326 transitions. [2019-01-14 04:37:16,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2019-01-14 04:37:16,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 988 states to 988 states and 1326 transitions. [2019-01-14 04:37:16,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 988 [2019-01-14 04:37:16,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 988 [2019-01-14 04:37:16,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 988 states and 1326 transitions. [2019-01-14 04:37:16,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:16,637 INFO L706 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2019-01-14 04:37:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states and 1326 transitions. [2019-01-14 04:37:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2019-01-14 04:37:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-01-14 04:37:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1326 transitions. [2019-01-14 04:37:16,672 INFO L729 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2019-01-14 04:37:16,672 INFO L609 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2019-01-14 04:37:16,672 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:37:16,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1326 transitions. [2019-01-14 04:37:16,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2019-01-14 04:37:16,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:16,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:16,682 INFO L867 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] [2019-01-14 04:37:16,682 INFO L868 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] [2019-01-14 04:37:16,688 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 [2019-01-14 04:37:16,688 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 [2019-01-14 04:37:16,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 6 times [2019-01-14 04:37:16,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:16,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:16,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 779870938, now seen corresponding path program 1 times [2019-01-14 04:37:16,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:16,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:16,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:16,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:16,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:16,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:16,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:16,824 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:16,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:16,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:16,825 INFO L87 Difference]: Start difference. First operand 988 states and 1326 transitions. cyclomatic complexity: 339 Second operand 3 states. [2019-01-14 04:37:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:17,145 INFO L93 Difference]: Finished difference Result 1925 states and 2547 transitions. [2019-01-14 04:37:17,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:17,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2547 transitions. [2019-01-14 04:37:17,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1900 [2019-01-14 04:37:17,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1925 states and 2547 transitions. [2019-01-14 04:37:17,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1925 [2019-01-14 04:37:17,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1925 [2019-01-14 04:37:17,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1925 states and 2547 transitions. [2019-01-14 04:37:17,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:17,223 INFO L706 BuchiCegarLoop]: Abstraction has 1925 states and 2547 transitions. [2019-01-14 04:37:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states and 2547 transitions. [2019-01-14 04:37:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1909. [2019-01-14 04:37:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1909 states. [2019-01-14 04:37:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2527 transitions. [2019-01-14 04:37:17,310 INFO L729 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2019-01-14 04:37:17,310 INFO L609 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2019-01-14 04:37:17,310 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:37:17,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1909 states and 2527 transitions. [2019-01-14 04:37:17,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1884 [2019-01-14 04:37:17,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:17,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:17,329 INFO L867 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] [2019-01-14 04:37:17,330 INFO L868 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] [2019-01-14 04:37:17,330 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 [2019-01-14 04:37:17,330 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 [2019-01-14 04:37:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 7 times [2019-01-14 04:37:17,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:17,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:17,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:17,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash -991600037, now seen corresponding path program 1 times [2019-01-14 04:37:17,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 04:37:17,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:17,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:17,684 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:17,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:17,686 INFO L87 Difference]: Start difference. First operand 1909 states and 2527 transitions. cyclomatic complexity: 619 Second operand 5 states. [2019-01-14 04:37:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:18,779 INFO L93 Difference]: Finished difference Result 3270 states and 4376 transitions. [2019-01-14 04:37:18,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:37:18,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3270 states and 4376 transitions. [2019-01-14 04:37:18,824 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 3203 [2019-01-14 04:37:18,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3270 states to 3270 states and 4376 transitions. [2019-01-14 04:37:18,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3270 [2019-01-14 04:37:18,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3270 [2019-01-14 04:37:18,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3270 states and 4376 transitions. [2019-01-14 04:37:18,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:18,885 INFO L706 BuchiCegarLoop]: Abstraction has 3270 states and 4376 transitions. [2019-01-14 04:37:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states and 4376 transitions. [2019-01-14 04:37:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 1735. [2019-01-14 04:37:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-01-14 04:37:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2280 transitions. [2019-01-14 04:37:18,961 INFO L729 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2019-01-14 04:37:18,965 INFO L609 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2019-01-14 04:37:18,965 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:37:18,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1735 states and 2280 transitions. [2019-01-14 04:37:18,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1700 [2019-01-14 04:37:18,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:18,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:18,989 INFO L867 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] [2019-01-14 04:37:18,990 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:18,990 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 [2019-01-14 04:37:18,990 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 [2019-01-14 04:37:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2019-01-14 04:37:18,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:18,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:18,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:19,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2019-01-14 04:37:19,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2019-01-14 04:37:19,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:19,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:19,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:19,283 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-14 04:37:19,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:19,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:19,306 INFO L87 Difference]: Start difference. First operand 1735 states and 2280 transitions. cyclomatic complexity: 548 Second operand 3 states. [2019-01-14 04:37:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:19,369 INFO L93 Difference]: Finished difference Result 2774 states and 3602 transitions. [2019-01-14 04:37:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:19,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2774 states and 3602 transitions. [2019-01-14 04:37:19,532 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2709 [2019-01-14 04:37:19,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2774 states to 2774 states and 3602 transitions. [2019-01-14 04:37:19,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2774 [2019-01-14 04:37:19,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2774 [2019-01-14 04:37:19,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2774 states and 3602 transitions. [2019-01-14 04:37:19,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:19,567 INFO L706 BuchiCegarLoop]: Abstraction has 2774 states and 3602 transitions. [2019-01-14 04:37:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states and 3602 transitions. [2019-01-14 04:37:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2682. [2019-01-14 04:37:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-01-14 04:37:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3490 transitions. [2019-01-14 04:37:19,629 INFO L729 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2019-01-14 04:37:19,629 INFO L609 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2019-01-14 04:37:19,629 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:37:19,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2682 states and 3490 transitions. [2019-01-14 04:37:19,645 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2019-01-14 04:37:19,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:19,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:19,646 INFO L867 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] [2019-01-14 04:37:19,647 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:19,647 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 [2019-01-14 04:37:19,647 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 [2019-01-14 04:37:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 918352559, now seen corresponding path program 1 times [2019-01-14 04:37:19,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:19,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:19,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:19,712 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 2 times [2019-01-14 04:37:19,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,175 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-14 04:37:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:20,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:20,205 INFO L87 Difference]: Start difference. First operand 2682 states and 3490 transitions. cyclomatic complexity: 811 Second operand 3 states. [2019-01-14 04:37:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:20,227 INFO L93 Difference]: Finished difference Result 2660 states and 3467 transitions. [2019-01-14 04:37:20,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:20,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2660 states and 3467 transitions. [2019-01-14 04:37:20,242 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2019-01-14 04:37:20,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2660 states to 2660 states and 3467 transitions. [2019-01-14 04:37:20,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2660 [2019-01-14 04:37:20,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2660 [2019-01-14 04:37:20,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2660 states and 3467 transitions. [2019-01-14 04:37:20,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:20,273 INFO L706 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2019-01-14 04:37:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states and 3467 transitions. [2019-01-14 04:37:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2660. [2019-01-14 04:37:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-01-14 04:37:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3467 transitions. [2019-01-14 04:37:20,329 INFO L729 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2019-01-14 04:37:20,329 INFO L609 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2019-01-14 04:37:20,329 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:37:20,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2660 states and 3467 transitions. [2019-01-14 04:37:20,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2019-01-14 04:37:20,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:20,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:20,346 INFO L867 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] [2019-01-14 04:37:20,347 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:20,348 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 [2019-01-14 04:37:20,350 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 [2019-01-14 04:37:20,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2019-01-14 04:37:20,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:20,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2019-01-14 04:37:20,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:20,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2019-01-14 04:37:20,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:20,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:20,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:20,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:20,980 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-01-14 04:37:21,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:21,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:21,002 INFO L87 Difference]: Start difference. First operand 2660 states and 3467 transitions. cyclomatic complexity: 810 Second operand 3 states. [2019-01-14 04:37:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:21,048 INFO L93 Difference]: Finished difference Result 4373 states and 5643 transitions. [2019-01-14 04:37:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:21,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4373 states and 5643 transitions. [2019-01-14 04:37:21,080 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2019-01-14 04:37:21,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4373 states to 4373 states and 5643 transitions. [2019-01-14 04:37:21,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2019-01-14 04:37:21,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4373 [2019-01-14 04:37:21,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4373 states and 5643 transitions. [2019-01-14 04:37:21,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:21,127 INFO L706 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2019-01-14 04:37:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states and 5643 transitions. [2019-01-14 04:37:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4373. [2019-01-14 04:37:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4373 states. [2019-01-14 04:37:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 5643 transitions. [2019-01-14 04:37:21,214 INFO L729 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2019-01-14 04:37:21,214 INFO L609 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2019-01-14 04:37:21,214 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 04:37:21,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4373 states and 5643 transitions. [2019-01-14 04:37:21,237 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2019-01-14 04:37:21,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:21,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:21,238 INFO L867 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] [2019-01-14 04:37:21,238 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:21,239 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 [2019-01-14 04:37:21,239 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 [2019-01-14 04:37:21,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2019-01-14 04:37:21,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2019-01-14 04:37:21,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:21,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,264 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2019-01-14 04:37:21,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,420 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-14 04:37:22,110 WARN L181 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2019-01-14 04:37:22,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:37:22 BoogieIcfgContainer [2019-01-14 04:37:22,247 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:37:22,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:37:22,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:37:22,249 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:37:22,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:36:59" (3/4) ... [2019-01-14 04:37:22,255 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:37:22,370 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:37:22,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:37:22,372 INFO L168 Benchmark]: Toolchain (without parser) took 24935.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.1 MB). Free memory was 951.4 MB in the beginning and 995.3 MB in the end (delta: -43.9 MB). Peak memory consumption was 227.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:22,376 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:37:22,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.90 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 933.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:22,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 172.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:22,377 INFO L168 Benchmark]: Boogie Preprocessor took 70.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:22,377 INFO L168 Benchmark]: RCFGBuilder took 1635.47 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: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:22,378 INFO L168 Benchmark]: BuchiAutomizer took 22402.16 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:22,378 INFO L168 Benchmark]: Witness Printer took 122.46 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 995.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:22,392 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 523.90 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 933.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 172.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1635.47 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: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22402.16 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. * Witness Printer took 122.46 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 995.3 MB 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 22.3s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 15.2s. Construction of modules took 3.7s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 4182 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.6s 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, 3.7s 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: 16ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - 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@193582a3=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79aeaa12=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63269fa6=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@406702a1=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@1e741f27=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@21b654ba=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9794daa=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71e0c725=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24474ef8=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...