./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/systemc/pc_sfifo_1_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 375e158327910cae8c3594f7d2ad0376509a1ecb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:04:52,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:04:52,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:04:52,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:04:52,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:04:52,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:04:52,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:04:52,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:04:52,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:04:52,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:04:52,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:04:52,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:04:52,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:04:52,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:04:52,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:04:52,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:04:52,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:04:52,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:04:52,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:04:52,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:04:52,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:04:52,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:04:52,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:04:52,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:04:52,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:04:52,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:04:52,669 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:04:52,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:04:52,670 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:04:52,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:04:52,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:04:52,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:04:52,673 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:04:52,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:04:52,674 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:04:52,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:04:52,675 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:04:52,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:04:52,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:04:52,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:04:52,700 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:04:52,700 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:04:52,701 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:04:52,701 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:04:52,701 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:04:52,701 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:04:52,701 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:04:52,702 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:04:52,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:04:52,703 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:04:52,703 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:04:52,703 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:04:52,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:04:52,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:04:52,704 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:04:52,704 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:04:52,705 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:04:52,705 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:04:52,705 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:04:52,705 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:04:52,705 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:04:52,705 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:04:52,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:04:52,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:04:52,706 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:04:52,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:04:52,706 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:04:52,708 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:04:52,709 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:04:52,709 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 -> 375e158327910cae8c3594f7d2ad0376509a1ecb [2018-11-29 00:04:52,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:04:52,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:04:52,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:04:52,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:04:52,775 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:04:52,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-29 00:04:52,847 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1ec3948/7a13b2a7243e47659709e99bc32400da/FLAGbad3de6ef [2018-11-29 00:04:53,319 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:04:53,320 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-29 00:04:53,330 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1ec3948/7a13b2a7243e47659709e99bc32400da/FLAGbad3de6ef [2018-11-29 00:04:53,666 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1ec3948/7a13b2a7243e47659709e99bc32400da [2018-11-29 00:04:53,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:04:53,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:04:53,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:04:53,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:04:53,683 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:04:53,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:53" (1/1) ... [2018-11-29 00:04:53,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7289ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:53, skipping insertion in model container [2018-11-29 00:04:53,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:53" (1/1) ... [2018-11-29 00:04:53,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:04:53,732 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:04:53,995 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:04:54,002 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:04:54,067 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:04:54,091 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:04:54,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54 WrapperNode [2018-11-29 00:04:54,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:04:54,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:04:54,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:04:54,093 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:04:54,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:04:54,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:04:54,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:04:54,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:04:54,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:04:54,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:04:54,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:04:54,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:04:54,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:54,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:04:54,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:04:55,068 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:04:55,068 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-11-29 00:04:55,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:55 BoogieIcfgContainer [2018-11-29 00:04:55,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:04:55,070 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:04:55,070 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:04:55,075 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:04:55,076 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:55,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:04:53" (1/3) ... [2018-11-29 00:04:55,078 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63bae083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:04:55, skipping insertion in model container [2018-11-29 00:04:55,078 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:55,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (2/3) ... [2018-11-29 00:04:55,079 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63bae083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:04:55, skipping insertion in model container [2018-11-29 00:04:55,079 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:55,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:55" (3/3) ... [2018-11-29 00:04:55,082 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-29 00:04:55,138 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:04:55,139 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:04:55,139 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:04:55,139 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:04:55,140 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:04:55,140 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:04:55,140 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:04:55,140 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:04:55,140 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:04:55,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-29 00:04:55,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-29 00:04:55,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:55,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:55,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:55,196 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:55,196 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:04:55,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-29 00:04:55,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-29 00:04:55,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:55,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:55,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:55,204 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:55,214 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 8#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 75#L346true havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 77#L196true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 74#L196-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 61#L313-1true [2018-11-29 00:04:55,215 INFO L796 eck$LassoCheckResult]: Loop: 61#L313-1true assume !false; 22#L314true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 64#L262true assume false; 37#L278true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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~2;havoc exists_runnable_thread_~__retres1~2; 69#L214-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 14#L226-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 42#L227-1true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 23#L292true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12#L299true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L300true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 67#L320true assume !(0 != start_simulation_~tmp~3); 61#L313-1true [2018-11-29 00:04:55,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,224 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2018-11-29 00:04:55,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:55,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:55,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:55,427 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:55,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2018-11-29 00:04:55,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:55,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:55,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:04:55,438 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:55,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:55,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:55,462 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2018-11-29 00:04:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:55,511 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-29 00:04:55,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:55,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2018-11-29 00:04:55,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-29 00:04:55,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2018-11-29 00:04:55,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-29 00:04:55,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:04:55,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2018-11-29 00:04:55,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:55,529 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-29 00:04:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2018-11-29 00:04:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-29 00:04:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-29 00:04:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2018-11-29 00:04:55,573 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-29 00:04:55,573 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-29 00:04:55,573 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:04:55,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2018-11-29 00:04:55,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-29 00:04:55,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:55,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:55,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:55,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:55,577 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 169#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 170#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 226#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 225#L196-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 222#L313-1 [2018-11-29 00:04:55,577 INFO L796 eck$LassoCheckResult]: Loop: 222#L313-1 assume !false; 191#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 174#L262 assume !false; 213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 214#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 185#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 186#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 199#L242 assume !(0 != eval_~tmp___1~0); 200#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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~2;havoc exists_runnable_thread_~__retres1~2; 206#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 183#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 184#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 192#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 179#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 180#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 210#L320 assume !(0 != start_simulation_~tmp~3); 222#L313-1 [2018-11-29 00:04:55,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2018-11-29 00:04:55,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:55,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:55,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:04:55,618 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:55,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2018-11-29 00:04:55,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:55,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:55,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:55,743 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:55,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:55,746 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-11-29 00:04:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:55,790 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2018-11-29 00:04:55,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:55,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2018-11-29 00:04:55,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-29 00:04:55,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2018-11-29 00:04:55,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-29 00:04:55,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:04:55,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2018-11-29 00:04:55,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:55,801 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-11-29 00:04:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2018-11-29 00:04:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-29 00:04:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-29 00:04:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2018-11-29 00:04:55,808 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-11-29 00:04:55,808 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-11-29 00:04:55,808 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:04:55,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2018-11-29 00:04:55,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-29 00:04:55,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:55,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:55,812 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:55,812 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:55,812 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 314#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 315#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 371#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 370#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 367#L313-1 [2018-11-29 00:04:55,812 INFO L796 eck$LassoCheckResult]: Loop: 367#L313-1 assume !false; 336#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 319#L262 assume !false; 358#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 359#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 330#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 331#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 344#L242 assume !(0 != eval_~tmp___1~0); 345#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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~2;havoc exists_runnable_thread_~__retres1~2; 351#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 328#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 337#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 324#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 325#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 352#L320 assume !(0 != start_simulation_~tmp~3); 367#L313-1 [2018-11-29 00:04:55,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,813 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2018-11-29 00:04:55,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:55,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,859 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2018-11-29 00:04:55,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:55,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:55,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:55,937 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:55,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:55,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:55,939 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 28 Second operand 5 states. [2018-11-29 00:04:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:56,174 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2018-11-29 00:04:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:04:56,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2018-11-29 00:04:56,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2018-11-29 00:04:56,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2018-11-29 00:04:56,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2018-11-29 00:04:56,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2018-11-29 00:04:56,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2018-11-29 00:04:56,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:56,187 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2018-11-29 00:04:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2018-11-29 00:04:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2018-11-29 00:04:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-29 00:04:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2018-11-29 00:04:56,195 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-11-29 00:04:56,195 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-11-29 00:04:56,195 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:04:56,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2018-11-29 00:04:56,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-29 00:04:56,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:56,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:56,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:56,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,198 INFO L794 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 532#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 533#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 591#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 590#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 587#L313-1 [2018-11-29 00:04:56,198 INFO L796 eck$LassoCheckResult]: Loop: 587#L313-1 assume !false; 554#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 535#L262 assume !false; 577#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 578#L214 assume !(0 == ~p_dw_st~0); 585#L218 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 548#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 549#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 592#L242 assume !(0 != eval_~tmp___1~0); 568#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, 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~2;havoc exists_runnable_thread_~__retres1~2; 569#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 546#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 547#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 555#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 542#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 543#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 572#L320 assume !(0 != start_simulation_~tmp~3); 587#L313-1 [2018-11-29 00:04:56,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2018-11-29 00:04:56,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:56,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2018-11-29 00:04:56,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:56,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:56,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:56,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:56,264 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:56,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:56,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:56,265 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-29 00:04:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:56,419 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2018-11-29 00:04:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:56,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2018-11-29 00:04:56,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-11-29 00:04:56,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2018-11-29 00:04:56,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-29 00:04:56,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-29 00:04:56,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2018-11-29 00:04:56,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:56,426 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2018-11-29 00:04:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2018-11-29 00:04:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-11-29 00:04:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-29 00:04:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2018-11-29 00:04:56,436 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-11-29 00:04:56,436 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-11-29 00:04:56,436 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:04:56,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2018-11-29 00:04:56,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-29 00:04:56,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:56,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:56,438 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,439 INFO L794 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 725#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 726#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 792#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 790#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 791#L313-1 assume !false; 803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 801#L262 [2018-11-29 00:04:56,440 INFO L796 eck$LassoCheckResult]: Loop: 801#L262 assume !false; 800#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 799#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 798#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 797#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 796#L242 assume 0 != eval_~tmp___1~0; 795#L242-1 assume !(0 == ~p_dw_st~0); 754#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 727#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 729#L139 assume !(0 == ~c_dr_pc~0); 744#L142 assume 1 == ~c_dr_pc~0; 745#L143 do_read_c_~a~0 := ~a_t~0; 750#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 784#L32-3 assume !(1 == ~p_dw_pc~0); 785#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 813#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 812#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 811#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 756#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 715#L51-3 assume 1 == ~c_dr_pc~0; 716#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 810#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 809#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 808#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 807#L82-5 ~q_read_ev~0 := 2; 806#L172 assume ~p_last_write~0 == ~c_last_read~0; 805#L173 assume ~p_num_write~0 == ~c_num_read~0; 804#L10-2 assume !false; 802#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 801#L262 [2018-11-29 00:04:56,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2018-11-29 00:04:56,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1836630604, now seen corresponding path program 1 times [2018-11-29 00:04:56,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:56,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:56,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:56,520 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:56,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:56,520 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. cyclomatic complexity: 34 Second operand 3 states. [2018-11-29 00:04:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:56,590 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2018-11-29 00:04:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:56,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2018-11-29 00:04:56,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-11-29 00:04:56,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2018-11-29 00:04:56,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-29 00:04:56,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-29 00:04:56,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2018-11-29 00:04:56,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:56,596 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2018-11-29 00:04:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2018-11-29 00:04:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-11-29 00:04:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-29 00:04:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2018-11-29 00:04:56,604 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-29 00:04:56,604 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-29 00:04:56,604 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:04:56,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2018-11-29 00:04:56,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-29 00:04:56,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:56,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:56,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,607 INFO L794 eck$LassoCheckResult]: Stem: 980#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 946#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 947#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1014#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1013#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1003#L313-1 assume !false; 968#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 969#L262 [2018-11-29 00:04:56,608 INFO L796 eck$LassoCheckResult]: Loop: 969#L262 assume !false; 992#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 993#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1011#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1021#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1020#L242 assume 0 != eval_~tmp___1~0; 1018#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1004#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 998#L96 assume 0 == ~p_dw_pc~0; 991#L107-1 assume !false; 997#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 974#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 948#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 950#L139 assume !(0 == ~c_dr_pc~0); 965#L142 assume 1 == ~c_dr_pc~0; 966#L143 do_read_c_~a~0 := ~a_t~0; 971#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1005#L32-3 assume !(1 == ~p_dw_pc~0); 1006#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 1034#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 983#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 975#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 976#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1032#L51-3 assume 1 == ~c_dr_pc~0; 1030#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1029#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1028#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1027#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1026#L82-5 ~q_read_ev~0 := 2; 1025#L172 assume ~p_last_write~0 == ~c_last_read~0; 1024#L173 assume ~p_num_write~0 == ~c_num_read~0; 1008#L10-2 assume !false; 999#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 969#L262 [2018-11-29 00:04:56,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2018-11-29 00:04:56,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,628 INFO L82 PathProgramCache]: Analyzing trace with hash 331104409, now seen corresponding path program 1 times [2018-11-29 00:04:56,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:56,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:56,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:56,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:56,698 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:56,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:56,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:56,699 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. cyclomatic complexity: 32 Second operand 3 states. [2018-11-29 00:04:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:56,735 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2018-11-29 00:04:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:56,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2018-11-29 00:04:56,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-11-29 00:04:56,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 159 transitions. [2018-11-29 00:04:56,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2018-11-29 00:04:56,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-11-29 00:04:56,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 159 transitions. [2018-11-29 00:04:56,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:56,742 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-11-29 00:04:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 159 transitions. [2018-11-29 00:04:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-29 00:04:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-29 00:04:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2018-11-29 00:04:56,750 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-11-29 00:04:56,750 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-11-29 00:04:56,751 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:04:56,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 159 transitions. [2018-11-29 00:04:56,752 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-11-29 00:04:56,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:56,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:56,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,753 INFO L794 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1176#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1177#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1250#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1249#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1242#L313-1 assume !false; 1199#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1200#L262 assume !false; 1266#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1265#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1264#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1263#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1207#L242 assume 0 != eval_~tmp___1~0; 1204#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1205#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1243#L96 assume 0 == ~p_dw_pc~0; 1231#L107-1 [2018-11-29 00:04:56,754 INFO L796 eck$LassoCheckResult]: Loop: 1231#L107-1 assume !false; 1233#L108 assume !(0 == ~q_free~0); 1193#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1194#L32 assume !(1 == ~p_dw_pc~0); 1246#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1185#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1186#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1219#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 1208#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1173#L51 assume !(1 == ~c_dr_pc~0); 1169#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1170#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1175#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1232#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1230#L82-2 ~q_write_ev~0 := 2; 1231#L107-1 [2018-11-29 00:04:56,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 1 times [2018-11-29 00:04:56,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash -62972986, now seen corresponding path program 1 times [2018-11-29 00:04:56,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:56,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:56,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:56,874 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:56,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:56,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:56,875 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. cyclomatic complexity: 36 Second operand 5 states. [2018-11-29 00:04:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:57,393 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2018-11-29 00:04:57,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:04:57,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 346 transitions. [2018-11-29 00:04:57,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 255 [2018-11-29 00:04:57,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 346 transitions. [2018-11-29 00:04:57,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2018-11-29 00:04:57,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2018-11-29 00:04:57,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 346 transitions. [2018-11-29 00:04:57,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:57,407 INFO L705 BuchiCegarLoop]: Abstraction has 275 states and 346 transitions. [2018-11-29 00:04:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 346 transitions. [2018-11-29 00:04:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 134. [2018-11-29 00:04:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-29 00:04:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2018-11-29 00:04:57,419 INFO L728 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-11-29 00:04:57,419 INFO L608 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-11-29 00:04:57,419 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:04:57,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 167 transitions. [2018-11-29 00:04:57,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 117 [2018-11-29 00:04:57,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:57,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:57,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:57,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:57,424 INFO L794 eck$LassoCheckResult]: Stem: 1621#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1589#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1590#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1659#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1657#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1658#L313-1 assume !false; 1690#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1689#L262 assume !false; 1688#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1687#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1686#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1685#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1684#L242 assume 0 != eval_~tmp___1~0; 1683#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1682#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1680#L96 assume 0 == ~p_dw_pc~0; 1642#L107-1 [2018-11-29 00:04:57,424 INFO L796 eck$LassoCheckResult]: Loop: 1642#L107-1 assume !false; 1644#L108 assume !(0 == ~q_free~0); 1606#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1607#L32 assume !(1 == ~p_dw_pc~0); 1653#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1598#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1599#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1633#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1619#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1586#L51 assume 1 == ~c_dr_pc~0; 1587#L52 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1583#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1588#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1643#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1641#L82-2 ~q_write_ev~0 := 2; 1642#L107-1 [2018-11-29 00:04:57,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:57,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 2 times [2018-11-29 00:04:57,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:57,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:57,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1078264795, now seen corresponding path program 1 times [2018-11-29 00:04:57,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:57,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:57,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:57,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1917816028, now seen corresponding path program 1 times [2018-11-29 00:04:57,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:57,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:57,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:57,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:57,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:57,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:58,014 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-11-29 00:04:58,116 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:04:58,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:04:58,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:04:58,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:04:58,118 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:04:58,118 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:58,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:04:58,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:04:58,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-29 00:04:58,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:04:58,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:04:58,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,602 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:04:58,604 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:58,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:58,612 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:58,639 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:58,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Honda state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:58,675 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:58,675 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:58,684 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:58,685 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Honda state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:58,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:58,709 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2018-11-29 00:04:58,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:04:58,770 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 [2018-11-29 00:04:58,847 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:04:58,850 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:04:58,851 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:04:58,851 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:04:58,851 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:04:58,851 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:04:58,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:58,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:04:58,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:04:58,852 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-29 00:04:58,852 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:04:58,852 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:04:58,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:58,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:59,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:59,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:59,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:59,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:59,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:59,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:59,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:59,422 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-29 00:04:59,564 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-29 00:04:59,662 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:04:59,668 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:04:59,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,680 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:59,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,681 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,693 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:59,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,694 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:59,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:59,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,735 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-29 00:04:59,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,736 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,737 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,740 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:59,740 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:59,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,752 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,757 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:59,757 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:59,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,766 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,767 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,781 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,786 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,787 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,803 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,804 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,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 [2018-11-29 00:04:59,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,810 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,811 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,815 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,815 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,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 [2018-11-29 00:04:59,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,821 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,821 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,825 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:59,826 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:59,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,834 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-29 00:04:59,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,838 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,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 [2018-11-29 00:04:59,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,846 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:59,847 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,848 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:59,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,867 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,868 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,873 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:59,874 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,875 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:59,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,878 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,884 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,888 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,889 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,906 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,910 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,926 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,930 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,937 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,939 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,955 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,959 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,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 [2018-11-29 00:04:59,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,966 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:59,967 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:59,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,973 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-29 00:04:59,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:59,979 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:59,979 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:59,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:59,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:59,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:59,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:59,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:59,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:59,987 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:59,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:59,991 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:59,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,010 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,013 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,018 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,020 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,022 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:05:00,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,026 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,026 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,029 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,030 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,035 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,036 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,053 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,056 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,076 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,076 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,089 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,090 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,110 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:00,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,120 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,121 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,130 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-29 00:05:00,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,134 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,135 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,135 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,141 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,145 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,145 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:00,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,173 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,173 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,174 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,186 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,187 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,187 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:00,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,203 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,203 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,204 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,210 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,210 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,211 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,216 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,225 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,225 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,236 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,252 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,253 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,259 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,268 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,269 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,276 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,281 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,282 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,287 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,310 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,311 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,312 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,322 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,323 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:00,327 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:00,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,361 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-29 00:05:00,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,367 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,368 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,369 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,377 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,377 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,380 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,380 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,382 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:00,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,399 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,399 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,405 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,416 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,416 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,418 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,418 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,419 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:00,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,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 [2018-11-29 00:05:00,425 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,425 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,429 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,430 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,435 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,436 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,436 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,446 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,446 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,453 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,470 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,470 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,470 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,471 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,483 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,486 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,487 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,488 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,497 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,498 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,499 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,528 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,528 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,535 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,545 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,545 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:00,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,545 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,547 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,555 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-29 00:05:00,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,559 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,561 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,565 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,570 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,571 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,576 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:05:00,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,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 [2018-11-29 00:05:00,596 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,596 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,597 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,600 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,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 [2018-11-29 00:05:00,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,616 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,616 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,617 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,621 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:05:00,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,626 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,626 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,634 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,635 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,640 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,640 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,640 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,645 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,652 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,652 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,659 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,684 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,685 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,686 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,694 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,694 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,696 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,698 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,698 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,700 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,726 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,726 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,728 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,733 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,733 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,739 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:00,741 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:00,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,743 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-29 00:05:00,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,744 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,749 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,750 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,753 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,753 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,753 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,757 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:00,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,774 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,774 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,784 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,784 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,784 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,785 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:00,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,795 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,799 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,802 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,803 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,813 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,815 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,815 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,833 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,837 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,837 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,848 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,848 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,848 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,849 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,857 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,857 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,861 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,873 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,874 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,886 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:00,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,886 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:00,889 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:00,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,896 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-29 00:05:00,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,902 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,903 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:00,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:00,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,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 [2018-11-29 00:05:00,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,913 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,913 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,913 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:00,915 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:05:00,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,948 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,948 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,951 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:00,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:00,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,962 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,962 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:00,962 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:00,968 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:05:00,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,975 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,975 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,980 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:00,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:00,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:00,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:00,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:00,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:00,986 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:00,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:00,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:00,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:00,987 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:00,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:00,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:01,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:01,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 [2018-11-29 00:05:01,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:01,001 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:01,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:01,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:01,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:01,002 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:01,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:01,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:01,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:01,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:01,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:01,046 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:01,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:01,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:01,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:01,047 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:01,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:01,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:01,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:01,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:01,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:01,063 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:01,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:01,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:01,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:01,065 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:01,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:01,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:01,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:01,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:01,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:01,070 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:01,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:01,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:01,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:01,071 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:01,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:01,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:01,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:01,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:01,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:01,079 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:01,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:01,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:01,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:01,080 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:01,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:01,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:01,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:01,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:01,088 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:01,088 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:01,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:01,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:01,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:01,090 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:01,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:01,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:01,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:01,099 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-11-29 00:05:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:01,316 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2018-11-29 00:05:01,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:01,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 270 transitions. [2018-11-29 00:05:01,319 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-11-29 00:05:01,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 270 transitions. [2018-11-29 00:05:01,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2018-11-29 00:05:01,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2018-11-29 00:05:01,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 270 transitions. [2018-11-29 00:05:01,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:01,324 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-11-29 00:05:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 270 transitions. [2018-11-29 00:05:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-29 00:05:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-29 00:05:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2018-11-29 00:05:01,345 INFO L728 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-11-29 00:05:01,345 INFO L608 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-11-29 00:05:01,345 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:05:01,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 270 transitions. [2018-11-29 00:05:01,350 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-11-29 00:05:01,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:01,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:01,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:01,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:01,352 INFO L794 eck$LassoCheckResult]: Stem: 1989#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1949#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1950#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2028#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2026#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2027#L313-1 assume !false; 2133#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2132#L262 assume !false; 2131#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2130#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2129#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2128#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1980#L242 assume 0 != eval_~tmp___1~0; 1977#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1978#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2013#L96 assume 0 == ~p_dw_pc~0; 2006#L107-1 [2018-11-29 00:05:01,354 INFO L796 eck$LassoCheckResult]: Loop: 2006#L107-1 assume !false; 2012#L108 assume !(0 == ~q_free~0); 1966#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1967#L32 assume !(1 == ~p_dw_pc~0); 2021#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1958#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1959#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1997#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1981#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1947#L51 assume !(1 == ~c_dr_pc~0); 1943#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1944#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1948#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2011#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 2010#L82-2 ~q_write_ev~0 := 2; 2006#L107-1 [2018-11-29 00:05:01,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 3 times [2018-11-29 00:05:01,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -872319612, now seen corresponding path program 1 times [2018-11-29 00:05:01,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:01,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:01,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:01,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:05:01,527 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:05:01,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:05:01,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:05:01,527 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. cyclomatic complexity: 54 Second operand 5 states. [2018-11-29 00:05:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:01,690 INFO L93 Difference]: Finished difference Result 428 states and 517 transitions. [2018-11-29 00:05:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:05:01,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 517 transitions. [2018-11-29 00:05:01,698 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 387 [2018-11-29 00:05:01,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 428 states and 517 transitions. [2018-11-29 00:05:01,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2018-11-29 00:05:01,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2018-11-29 00:05:01,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 517 transitions. [2018-11-29 00:05:01,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:01,704 INFO L705 BuchiCegarLoop]: Abstraction has 428 states and 517 transitions. [2018-11-29 00:05:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 517 transitions. [2018-11-29 00:05:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 229. [2018-11-29 00:05:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-29 00:05:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2018-11-29 00:05:01,719 INFO L728 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-11-29 00:05:01,719 INFO L608 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-11-29 00:05:01,719 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:05:01,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 275 transitions. [2018-11-29 00:05:01,722 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 210 [2018-11-29 00:05:01,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:01,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:01,723 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:01,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:01,724 INFO L794 eck$LassoCheckResult]: Stem: 2654#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2613#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2614#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2701#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2699#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2700#L313-1 assume !false; 2747#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2746#L262 assume !false; 2745#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2744#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2743#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2742#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 2741#L242 assume 0 != eval_~tmp___1~0; 2740#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 2688#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2680#L96 assume 0 == ~p_dw_pc~0; 2670#L107-1 [2018-11-29 00:05:01,724 INFO L796 eck$LassoCheckResult]: Loop: 2670#L107-1 assume !false; 2679#L108 assume !(0 == ~q_free~0); 2757#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2756#L32 assume !(1 == ~p_dw_pc~0); 2693#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 2622#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2623#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2664#L74 assume !(0 != immediate_notify_threads_~tmp~0); 2646#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2647#L51 assume !(1 == ~c_dr_pc~0); 2605#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 2606#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2677#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2678#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 2674#L82-2 ~q_write_ev~0 := 2; 2670#L107-1 [2018-11-29 00:05:01,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 4 times [2018-11-29 00:05:01,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -872319550, now seen corresponding path program 1 times [2018-11-29 00:05:01,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2123761273, now seen corresponding path program 1 times [2018-11-29 00:05:01,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:02,583 WARN L180 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-29 00:05:02,966 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-29 00:05:02,980 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:05:02,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:05:02,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:05:02,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:05:02,981 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:05:02,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:02,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:05:02,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:05:02,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-29 00:05:02,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:05:02,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:05:02,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:03,312 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-29 00:05:03,493 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-29 00:05:03,693 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-29 00:05:03,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:05:03,852 INFO L412 LassoAnalysis]: Checking for nontermination... 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) [2018-11-29 00:05:03,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:05:03,864 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 [2018-11-29 00:05:03,869 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:05:03,869 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:03,892 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:05:03,892 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:05:03,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:05:03,895 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:03,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:05:03,918 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:03,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:05:03,958 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:05:03,993 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:05:03,996 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:05:03,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:05:03,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:05:03,996 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:05:03,997 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:05:03,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:03,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:05:03,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:05:03,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-29 00:05:03,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:05:03,997 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:05:03,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:04,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:05:04,245 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:05:04,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:05:04,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:05:04,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,261 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,261 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:05:04,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:05:04,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:05:04,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:05:04,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,287 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,287 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:05:04,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,294 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:04,294 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,298 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-29 00:05:04,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,299 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,299 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,301 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,301 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,305 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,306 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,316 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,316 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,318 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,321 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,323 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,326 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,328 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,328 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,334 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,336 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,338 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,338 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,348 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,348 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,349 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-29 00:05:04,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,350 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,351 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,352 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,356 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,358 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,358 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,358 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:04,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,372 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,372 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,375 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,375 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,377 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,377 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,379 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,380 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,383 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,383 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,384 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:04,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,386 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,386 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,396 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,396 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,397 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:04,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,397 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-29 00:05:04,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,398 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,398 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,403 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,404 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,406 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,406 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,406 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:05:04,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,411 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,411 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,413 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,414 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,416 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,417 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,419 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,419 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,422 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,422 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,423 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:05:04,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,425 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,425 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:04,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,432 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,432 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,432 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:05:04,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,433 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-29 00:05:04,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,434 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,435 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,435 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,435 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,439 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,440 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,440 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,445 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,445 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,445 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,459 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,461 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,461 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,462 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,467 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,467 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,468 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,468 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,474 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,475 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,475 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,480 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,481 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,491 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,491 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,500 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,500 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,501 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:05:04,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,505 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,506 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,506 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:05:04,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,510 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-29 00:05:04,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,510 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,510 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,511 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,511 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,520 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,520 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,520 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,521 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,523 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,523 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,524 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,525 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:04,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,532 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,532 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,535 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,536 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,540 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,540 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,541 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,551 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,551 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,552 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,555 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,556 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,557 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,561 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,562 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,563 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,564 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:04,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,568 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,569 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,576 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:05:04,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,577 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,577 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,578 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:04,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,581 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-29 00:05:04,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,582 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,582 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,583 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,584 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,585 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,586 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,587 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,589 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,589 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,589 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,592 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:05:04,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,606 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,615 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,617 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,625 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,625 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,628 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,631 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,631 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,631 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,633 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,636 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,636 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,637 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,645 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,646 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,646 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,646 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,648 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:05:04,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,656 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,657 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,658 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:05:04,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,677 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,677 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,677 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,677 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:05:04,679 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:05:04,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,687 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-29 00:05:04,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,690 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,694 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,695 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,698 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,699 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,700 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:04,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,708 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,708 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,709 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,714 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,715 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,717 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,721 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,721 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,722 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,723 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,728 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,729 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,729 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,733 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,734 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,734 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,734 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,735 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:04,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,739 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,739 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,740 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:05:04,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,745 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:05:04,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,746 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,746 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:05:04,746 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:05:04,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,750 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-29 00:05:04,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,776 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,777 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,783 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,784 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,784 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,799 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,799 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,799 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,799 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,803 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:05:04,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,829 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,829 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,830 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,854 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,855 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,872 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,877 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,900 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,901 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,917 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,918 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,918 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,919 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:05:04,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,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 [2018-11-29 00:05:04,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,930 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:04,936 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:04,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:04,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:04,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:05:04,947 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:05:04,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:04,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:04,948 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:04,948 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:05:04,949 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:05:04,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:04,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:06,042 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-29 00:05:06,111 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:05:06,111 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:05:06,111 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:05:06,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:05:06,112 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:05:06,112 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:06,112 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:05:06,112 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:05:06,112 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-11-29 00:05:06,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:05:06,112 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:05:06,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:06,998 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:05:06,998 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:07,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:05:07,005 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:05:07,025 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:05:07,025 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:07,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:05:07,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:05:07,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:05:07,058 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~__retres1~3=0} Honda state: {ULTIMATE.start_main_~__retres1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:07,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:05:07,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:05:07,090 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:05:07,090 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_st~0=0} Honda state: {~c_dr_st~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:07,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:05:07,116 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:07,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:05:07,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:05:07,164 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:05:07,166 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:05:07,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:05:07,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:05:07,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:05:07,166 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:05:07,167 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:05:07,167 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:05:07,167 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:05:07,167 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-11-29 00:05:07,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:05:07,167 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:05:07,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05: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 [2018-11-29 00:05:07,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05: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 [2018-11-29 00:05:07,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05: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 [2018-11-29 00:05:07,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:05:07,443 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-29 00:05:07,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:05:07,852 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:05:07,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:07,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:07,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:07,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:07,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:07,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:07,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:05:07,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:07,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:07,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:07,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:07,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:07,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:07,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:07,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:05:07,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:07,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:07,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:07,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:07,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:05:07,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:07,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:07,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:07,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:05:07,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:05:07,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:07,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:07,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:07,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:07,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:05:07,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:07,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:05:07,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:05:07,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:05:07,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:05:07,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:05:07,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:05:07,890 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:05:07,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:05:07,894 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-29 00:05:07,894 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-29 00:05:07,918 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:05:07,926 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:05:07,927 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:05:07,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:05:07,937 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-29 00:05:07,937 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:05:07,938 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2018-11-29 00:05:07,986 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-29 00:05:08,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:08,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:05:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:08,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:05:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:09,065 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:05:09,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50 Second operand 6 states. [2018-11-29 00:05:09,369 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50. Second operand 6 states. Result 1087 states and 1324 transitions. Complement of second has 9 states. [2018-11-29 00:05:09,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:05:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:05:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2018-11-29 00:05:09,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 15 letters. [2018-11-29 00:05:09,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:05:09,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 31 letters. Loop has 15 letters. [2018-11-29 00:05:09,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:05:09,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 30 letters. [2018-11-29 00:05:09,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:05:09,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1324 transitions. [2018-11-29 00:05:09,396 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 563 [2018-11-29 00:05:09,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 892 states and 1084 transitions. [2018-11-29 00:05:09,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2018-11-29 00:05:09,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2018-11-29 00:05:09,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1084 transitions. [2018-11-29 00:05:09,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:05:09,405 INFO L705 BuchiCegarLoop]: Abstraction has 892 states and 1084 transitions. [2018-11-29 00:05:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1084 transitions. [2018-11-29 00:05:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 659. [2018-11-29 00:05:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-11-29 00:05:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2018-11-29 00:05:09,425 INFO L728 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-11-29 00:05:09,425 INFO L608 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-11-29 00:05:09,425 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:05:09,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 802 transitions. [2018-11-29 00:05:09,434 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 377 [2018-11-29 00:05:09,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:09,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:09,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:09,438 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:09,438 INFO L794 eck$LassoCheckResult]: Stem: 4150#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 4071#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 4072#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4231#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4229#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4230#L313-1 assume !false; 4372#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 4371#L262 assume !false; 4370#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4369#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4368#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4367#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 4366#L242 assume 0 != eval_~tmp___1~0; 4365#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 4364#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 4363#L96 assume !(0 == ~p_dw_pc~0); 4174#L99 assume 1 == ~p_dw_pc~0; 4175#L109 [2018-11-29 00:05:09,438 INFO L796 eck$LassoCheckResult]: Loop: 4175#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4083#L32 assume 1 == ~p_dw_pc~0; 4084#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 4088#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4089#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4166#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 4689#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4063#L51 assume !(1 == ~c_dr_pc~0); 4064#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 4682#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4683#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 4598#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 4599#L82-2 ~q_write_ev~0 := 2; 4590#L107-1 assume !false; 4591#L108 assume !(0 == ~q_free~0); 4175#L109 [2018-11-29 00:05:09,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:09,438 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2018-11-29 00:05:09,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:09,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:09,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:09,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:09,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:09,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:09,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:05:09,508 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:05:09,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1691430829, now seen corresponding path program 1 times [2018-11-29 00:05:09,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:09,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:09,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:09,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-29 00:05:09,572 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:05:09,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:09,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:09,572 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. cyclomatic complexity: 155 Second operand 3 states. [2018-11-29 00:05:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:09,705 INFO L93 Difference]: Finished difference Result 372 states and 445 transitions. [2018-11-29 00:05:09,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:09,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 445 transitions. [2018-11-29 00:05:09,709 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 233 [2018-11-29 00:05:09,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 314 states and 376 transitions. [2018-11-29 00:05:09,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2018-11-29 00:05:09,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2018-11-29 00:05:09,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 376 transitions. [2018-11-29 00:05:09,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:05:09,712 INFO L705 BuchiCegarLoop]: Abstraction has 314 states and 376 transitions. [2018-11-29 00:05:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 376 transitions. [2018-11-29 00:05:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2018-11-29 00:05:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-29 00:05:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 301 transitions. [2018-11-29 00:05:09,720 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-11-29 00:05:09,720 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-11-29 00:05:09,720 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-29 00:05:09,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 301 transitions. [2018-11-29 00:05:09,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2018-11-29 00:05:09,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:09,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:09,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:09,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:09,726 INFO L794 eck$LassoCheckResult]: Stem: 5135#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5097#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 5098#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5176#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5174#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5175#L313-1 assume !false; 5218#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5215#L262 assume !false; 5213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5211#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5209#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5207#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5205#L242 assume 0 != eval_~tmp___1~0; 5200#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5166#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5167#L96 assume 0 == ~p_dw_pc~0; 5199#L107-1 assume !false; 5156#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5125#L247 [2018-11-29 00:05:09,727 INFO L796 eck$LassoCheckResult]: Loop: 5125#L247 assume !(0 == ~c_dr_st~0); 5100#L262 assume !false; 5150#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5151#L214 assume !(0 == ~p_dw_st~0); 5163#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5112#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5113#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5127#L242 assume 0 != eval_~tmp___1~0; 5124#L242-1 assume !(0 == ~p_dw_st~0); 5125#L247 [2018-11-29 00:05:09,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:09,727 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 1 times [2018-11-29 00:05:09,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:09,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:09,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:09,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:09,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:09,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:09,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:05:09,792 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:05:09,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:09,793 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2018-11-29 00:05:09,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:09,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:09,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:09,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:09,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:09,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:05:09,847 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:05:09,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:09,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:09,847 INFO L87 Difference]: Start difference. First operand 249 states and 301 transitions. cyclomatic complexity: 54 Second operand 3 states. [2018-11-29 00:05:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:09,970 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2018-11-29 00:05:09,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:09,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 364 transitions. [2018-11-29 00:05:09,977 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 258 [2018-11-29 00:05:09,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 364 transitions. [2018-11-29 00:05:09,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2018-11-29 00:05:09,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2018-11-29 00:05:09,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 364 transitions. [2018-11-29 00:05:09,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:05:09,981 INFO L705 BuchiCegarLoop]: Abstraction has 308 states and 364 transitions. [2018-11-29 00:05:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 364 transitions. [2018-11-29 00:05:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 218. [2018-11-29 00:05:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-29 00:05:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2018-11-29 00:05:09,991 INFO L728 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-11-29 00:05:09,991 INFO L608 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-11-29 00:05:09,991 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-29 00:05:09,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 258 transitions. [2018-11-29 00:05:09,998 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-29 00:05:09,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:09,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:09,999 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:09,999 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:10,003 INFO L794 eck$LassoCheckResult]: Stem: 5701#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5661#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 5662#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5737#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5735#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5736#L313-1 assume !false; 5803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5801#L262 assume !false; 5799#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5796#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5794#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5791#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5789#L242 assume 0 != eval_~tmp___1~0; 5788#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5782#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5781#L96 assume 0 == ~p_dw_pc~0; 5777#L107-1 assume !false; 5748#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5744#L247 [2018-11-29 00:05:10,003 INFO L796 eck$LassoCheckResult]: Loop: 5744#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 5663#L266 assume !(0 != eval_~tmp___0~1); 5664#L262 assume !false; 5776#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5774#L214 assume !(0 == ~p_dw_st~0); 5772#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5770#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5768#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5764#L242 assume 0 != eval_~tmp___1~0; 5749#L242-1 assume !(0 == ~p_dw_st~0); 5744#L247 [2018-11-29 00:05:10,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 2 times [2018-11-29 00:05:10,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:10,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:10,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:10,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:05:10,085 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:05:10,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2018-11-29 00:05:10,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,417 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-11-29 00:05:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:10,472 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. cyclomatic complexity: 43 Second operand 3 states. [2018-11-29 00:05:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:10,485 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2018-11-29 00:05:10,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:10,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 282 transitions. [2018-11-29 00:05:10,491 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 190 [2018-11-29 00:05:10,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 240 states and 281 transitions. [2018-11-29 00:05:10,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2018-11-29 00:05:10,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2018-11-29 00:05:10,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 281 transitions. [2018-11-29 00:05:10,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:10,498 INFO L705 BuchiCegarLoop]: Abstraction has 240 states and 281 transitions. [2018-11-29 00:05:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 281 transitions. [2018-11-29 00:05:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2018-11-29 00:05:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-29 00:05:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2018-11-29 00:05:10,505 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-11-29 00:05:10,507 INFO L608 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-11-29 00:05:10,507 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-29 00:05:10,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 256 transitions. [2018-11-29 00:05:10,508 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-29 00:05:10,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:10,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:10,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:10,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:10,513 INFO L794 eck$LassoCheckResult]: Stem: 6168#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6127#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6128#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6210#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6209#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6199#L313-1 assume !false; 6149#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6150#L262 assume !false; 6184#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6185#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6260#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6259#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6158#L242 assume 0 != eval_~tmp___1~0; 6159#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6257#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6256#L96 assume !(0 == ~p_dw_pc~0); 6182#L99 assume 1 == ~p_dw_pc~0; 6144#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6145#L32 assume 1 == ~p_dw_pc~0; 6174#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 6175#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6250#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6247#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6191#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6124#L51 assume !(1 == ~c_dr_pc~0); 6125#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6239#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6236#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6232#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6228#L82-2 ~q_write_ev~0 := 2; 6224#L107-1 assume !false; 6220#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6217#L247 [2018-11-29 00:05:10,513 INFO L796 eck$LassoCheckResult]: Loop: 6217#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6129#L266 assume !(0 != eval_~tmp___0~1); 6130#L262 assume !false; 6242#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6240#L214 assume !(0 == ~p_dw_st~0); 6237#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6233#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6229#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6225#L242 assume 0 != eval_~tmp___1~0; 6221#L242-1 assume !(0 == ~p_dw_st~0); 6217#L247 [2018-11-29 00:05:10,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2034026126, now seen corresponding path program 1 times [2018-11-29 00:05:10,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:10,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:10,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:10,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:05:10,564 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:05:10,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 2 times [2018-11-29 00:05:10,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:10,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:10,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:10,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:10,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:10,688 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. cyclomatic complexity: 42 Second operand 3 states. [2018-11-29 00:05:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:10,706 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2018-11-29 00:05:10,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:10,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 244 transitions. [2018-11-29 00:05:10,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-29 00:05:10,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 244 transitions. [2018-11-29 00:05:10,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2018-11-29 00:05:10,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2018-11-29 00:05:10,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 244 transitions. [2018-11-29 00:05:10,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:10,714 INFO L705 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-11-29 00:05:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 244 transitions. [2018-11-29 00:05:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-29 00:05:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-29 00:05:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2018-11-29 00:05:10,719 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-11-29 00:05:10,719 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-11-29 00:05:10,720 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-29 00:05:10,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 244 transitions. [2018-11-29 00:05:10,721 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-29 00:05:10,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:10,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:10,723 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-11-29 00:05:10,723 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:10,723 INFO L794 eck$LassoCheckResult]: Stem: 6599#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6560#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6561#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6642#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6640#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6641#L313-1 assume !false; 6681#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6679#L262 assume !false; 6677#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6675#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6670#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6666#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6662#L242 assume 0 != eval_~tmp___1~0; 6659#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6633#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6625#L96 assume 0 == ~p_dw_pc~0; 6626#L107-1 assume !false; 6651#L108 assume !(0 == ~q_free~0); 6577#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6567#L32 assume !(1 == ~p_dw_pc~0); 6568#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 6569#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6570#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6608#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6594#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6557#L51 assume !(1 == ~c_dr_pc~0); 6558#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6692#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6690#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6688#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6687#L82-2 ~q_write_ev~0 := 2; 6686#L107-1 assume !false; 6671#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6667#L247 [2018-11-29 00:05:10,723 INFO L796 eck$LassoCheckResult]: Loop: 6667#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6562#L266 assume !(0 != eval_~tmp___0~1); 6563#L262 assume !false; 6615#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6616#L214 assume !(0 == ~p_dw_st~0); 6693#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6685#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6612#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6592#L242 assume 0 != eval_~tmp___1~0; 6593#L242-1 assume !(0 == ~p_dw_st~0); 6667#L247 [2018-11-29 00:05:10,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2018-11-29 00:05:10,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:10,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:10,743 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 3 times [2018-11-29 00:05:10,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:10,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:10,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:10,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:10,750 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2018-11-29 00:05:10,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:10,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:10,880 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-11-29 00:05:11,222 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2018-11-29 00:05:11,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:05:11 BoogieIcfgContainer [2018-11-29 00:05:11,353 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:05:11,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:05:11,354 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:05:11,354 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:05:11,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:55" (3/4) ... [2018-11-29 00:05:11,362 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-29 00:05:11,452 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-29 00:05:11,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:05:11,458 INFO L168 Benchmark]: Toolchain (without parser) took 17787.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 954.0 MB in the beginning and 882.1 MB in the end (delta: 71.9 MB). Peak memory consumption was 386.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:11,459 INFO L168 Benchmark]: CDTParser took 0.15 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. [2018-11-29 00:05:11,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.16 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 942.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:11,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.93 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:11,461 INFO L168 Benchmark]: Boogie Preprocessor took 121.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:11,462 INFO L168 Benchmark]: RCFGBuilder took 778.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:11,462 INFO L168 Benchmark]: BuchiAutomizer took 16283.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 891.2 MB in the end (delta: 191.9 MB). Peak memory consumption was 379.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:11,462 INFO L168 Benchmark]: Witness Printer took 103.79 ms. Allocated memory is still 1.3 GB. Free memory was 891.2 MB in the beginning and 882.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:11,469 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.15 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 413.16 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 942.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.93 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 778.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16283.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 891.2 MB in the end (delta: 191.9 MB). Peak memory consumption was 379.1 MB. Max. memory is 11.5 GB. * Witness Printer took 103.79 ms. Allocated memory is still 1.3 GB. Free memory was 891.2 MB in the beginning and 882.1 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 (13 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function q_free and consists of 6 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 210 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.2s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 12.5s. Construction of modules took 1.4s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 848 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 659 states and ocurred in iteration 10. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1747 SDtfs, 1631 SDslu, 1732 SDs, 0 SdLazy, 203 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc1 concLT0 SILN2 SILU0 SILI4 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp18 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq210 hnf86 smp100 dnf118 smp100 tf105 neg92 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 47ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 262]: 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 {p_last_write=4, c_dr_i=1, c_dr_pc=0, a_t=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e40af=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@563a2320=0, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7af7efe4=0, tmp=0, q_free=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a459b95=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7555592f=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18e10513=0, p_dw_st=2, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6995e3ab=0, tmp=0, c_last_read=0, __retres1=0, p_num_write=1, q_buf_0=4, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 237]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int q_buf_0 ; [L15] int q_free ; [L16] int q_read_ev ; [L17] int q_write_ev ; [L18] int p_num_write ; [L19] int p_last_write ; [L20] int p_dw_st ; [L21] int p_dw_pc ; [L22] int p_dw_i ; [L23] int c_num_read ; [L24] int c_last_read ; [L25] int c_dr_st ; [L26] int c_dr_pc ; [L27] int c_dr_i ; [L134] static int a_t ; [L350] int __retres1 ; [L336] q_free = 1 [L337] q_write_ev = 2 [L338] q_read_ev = q_write_ev [L339] p_num_write = 0 [L340] p_dw_pc = 0 [L341] p_dw_i = 1 [L342] c_num_read = 0 [L343] c_dr_pc = 0 [L344] c_dr_i = 1 [L304] int kernel_st ; [L305] int tmp ; [L309] kernel_st = 0 [L196] COND TRUE (int )p_dw_i == 1 [L197] p_dw_st = 0 [L201] COND TRUE (int )c_dr_i == 1 [L202] c_dr_st = 0 [L313] COND TRUE 1 [L316] kernel_st = 1 [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND TRUE (int )p_dw_st == 0 [L215] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND TRUE (int )p_dw_st == 0 [L249] tmp = __VERIFIER_nondet_int() [L251] COND TRUE \read(tmp) [L253] p_dw_st = 1 [L96] COND TRUE (int )p_dw_pc == 0 [L107] COND TRUE 1 [L109] COND FALSE !((int )q_free == 0) [L119] q_buf_0 = __VERIFIER_nondet_int() [L120] p_last_write = q_buf_0 [L121] p_num_write += 1 [L122] q_free = 0 [L123] q_write_ev = 1 [L67] int tmp ; [L68] int tmp___0 ; [L29] int __retres1 ; [L32] COND FALSE !((int )p_dw_pc == 1) [L42] __retres1 = 0 [L44] return (__retres1); [L72] tmp = is_do_write_p_triggered() [L74] COND FALSE !(\read(tmp)) [L48] int __retres1 ; [L51] COND FALSE !((int )c_dr_pc == 1) [L61] __retres1 = 0 [L63] return (__retres1); [L80] tmp___0 = is_do_read_c_triggered() [L82] COND FALSE !(\read(tmp___0)) [L125] q_write_ev = 2 [L107] COND TRUE 1 [L109] COND TRUE (int )q_free == 0 [L110] p_dw_st = 2 [L111] p_dw_pc = 1 Loop: [L262] COND TRUE (int )c_dr_st == 0 [L264] tmp___0 = __VERIFIER_nondet_int() [L266] COND FALSE !(\read(tmp___0)) [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND FALSE !((int )p_dw_st == 0) [L218] COND TRUE (int )c_dr_st == 0 [L219] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...