./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.23-635dfa2 [2018-12-09 15:25:44,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:25:44,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:25:44,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:25:44,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:25:44,615 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:25:44,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:25:44,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:25:44,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:25:44,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:25:44,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:25:44,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:25:44,619 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:25:44,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:25:44,620 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:25:44,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:25:44,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:25:44,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:25:44,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:25:44,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:25:44,624 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:25:44,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:25:44,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:25:44,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:25:44,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:25:44,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:25:44,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:25:44,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:25:44,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:25:44,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:25:44,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:25:44,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:25:44,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:25:44,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:25:44,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:25:44,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:25:44,631 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 15:25:44,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:25:44,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:25:44,639 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:25:44,639 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:25:44,640 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 15:25:44,640 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 15:25:44,640 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 15:25:44,640 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 15:25:44,640 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 15:25:44,640 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 15:25:44,640 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 15:25:44,640 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:25:44,641 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:25:44,641 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:25:44,641 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:25:44,641 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:25:44,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:25:44,641 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 15:25:44,641 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 15:25:44,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 15:25:44,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:25:44,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:25:44,642 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 15:25:44,642 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:25:44,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 15:25:44,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:25:44,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:25:44,642 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 15:25:44,642 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:25:44,643 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 15:25:44,643 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 15:25:44,643 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 15:25:44,643 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 375e158327910cae8c3594f7d2ad0376509a1ecb [2018-12-09 15:25:44,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:25:44,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:25:44,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:25:44,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:25:44,669 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:25:44,670 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-12-09 15:25:44,703 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/data/67ca5455a/9dafe0b2febb4e76a02451ab3c8c7fdf/FLAGcbcfe90e5 [2018-12-09 15:25:45,102 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:25:45,103 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-12-09 15:25:45,107 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/data/67ca5455a/9dafe0b2febb4e76a02451ab3c8c7fdf/FLAGcbcfe90e5 [2018-12-09 15:25:45,116 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/data/67ca5455a/9dafe0b2febb4e76a02451ab3c8c7fdf [2018-12-09 15:25:45,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:25:45,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:25:45,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:25:45,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:25:45,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:25:45,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537737cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45, skipping insertion in model container [2018-12-09 15:25:45,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:25:45,143 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:25:45,240 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:25:45,244 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:25:45,261 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:25:45,270 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:25:45,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45 WrapperNode [2018-12-09 15:25:45,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:25:45,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:25:45,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:25:45,271 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:25:45,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:25:45,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:25:45,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:25:45,294 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:25:45,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... [2018-12-09 15:25:45,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:25:45,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:25:45,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:25:45,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:25:45,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:25:45,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:25:45,564 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:25:45,564 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-12-09 15:25:45,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:45 BoogieIcfgContainer [2018-12-09 15:25:45,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:25:45,565 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 15:25:45,565 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 15:25:45,567 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 15:25:45,568 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:25:45,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 03:25:45" (1/3) ... [2018-12-09 15:25:45,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57842132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:25:45, skipping insertion in model container [2018-12-09 15:25:45,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:25:45,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:45" (2/3) ... [2018-12-09 15:25:45,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57842132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:25:45, skipping insertion in model container [2018-12-09 15:25:45,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:25:45,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:45" (3/3) ... [2018-12-09 15:25:45,570 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-12-09 15:25:45,602 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:25:45,602 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 15:25:45,602 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 15:25:45,602 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 15:25:45,602 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:25:45,602 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:25:45,602 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 15:25:45,603 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:25:45,603 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 15:25:45,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-12-09 15:25:45,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-12-09 15:25:45,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:45,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:45,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 15:25:45,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:45,630 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 15:25:45,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-12-09 15:25:45,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-12-09 15:25:45,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:45,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:45,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 15:25:45,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:45,638 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-12-09 15:25:45,638 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-12-09 15:25:45,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:45,641 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2018-12-09 15:25:45,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:45,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:45,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:45,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:45,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:45,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:25:45,722 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:25:45,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2018-12-09 15:25:45,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:45,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:45,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:45,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:45,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:45,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:25:45,727 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:45,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:45,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:45,737 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2018-12-09 15:25:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:45,753 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-12-09 15:25:45,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:45,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2018-12-09 15:25:45,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-12-09 15:25:45,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2018-12-09 15:25:45,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-09 15:25:45,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-09 15:25:45,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2018-12-09 15:25:45,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:45,761 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-12-09 15:25:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2018-12-09 15:25:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 15:25:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 15:25:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2018-12-09 15:25:45,779 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-12-09 15:25:45,779 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-12-09 15:25:45,779 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 15:25:45,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2018-12-09 15:25:45,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-12-09 15:25:45,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:45,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:45,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 15:25:45,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:45,781 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-12-09 15:25:45,781 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-12-09 15:25:45,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:45,781 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2018-12-09 15:25:45,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:45,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:45,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:45,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:45,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:25:45,797 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:25:45,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2018-12-09 15:25:45,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:45,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:45,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:45,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:25:45,821 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:45,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:45,821 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-12-09 15:25:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:45,826 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2018-12-09 15:25:45,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:45,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2018-12-09 15:25:45,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-12-09 15:25:45,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2018-12-09 15:25:45,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-09 15:25:45,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-09 15:25:45,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2018-12-09 15:25:45,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:45,829 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-12-09 15:25:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2018-12-09 15:25:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 15:25:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 15:25:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2018-12-09 15:25:45,832 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-12-09 15:25:45,832 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-12-09 15:25:45,832 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 15:25:45,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2018-12-09 15:25:45,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-12-09 15:25:45,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:45,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:45,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 15:25:45,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:45,834 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-12-09 15:25:45,834 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-12-09 15:25:45,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:45,834 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2018-12-09 15:25:45,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:45,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:45,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:45,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:45,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2018-12-09 15:25:45,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:45,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:45,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:45,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:45,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:25:45,878 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:45,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:25:45,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:25:45,879 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 28 Second operand 5 states. [2018-12-09 15:25:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:45,938 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2018-12-09 15:25:45,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:25:45,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2018-12-09 15:25:45,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2018-12-09 15:25:45,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2018-12-09 15:25:45,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2018-12-09 15:25:45,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2018-12-09 15:25:45,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2018-12-09 15:25:45,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:45,943 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2018-12-09 15:25:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2018-12-09 15:25:45,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2018-12-09 15:25:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-09 15:25:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2018-12-09 15:25:45,947 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-12-09 15:25:45,947 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-12-09 15:25:45,947 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 15:25:45,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2018-12-09 15:25:45,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-12-09 15:25:45,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:45,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:45,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 15:25:45,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:45,948 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-12-09 15:25:45,949 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-12-09 15:25:45,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:45,949 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2018-12-09 15:25:45,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:45,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:45,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:25:45,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:45,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:45,960 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2018-12-09 15:25:45,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:45,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:25:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:45,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:45,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:25:45,972 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:45,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:45,972 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-12-09 15:25:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:45,988 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2018-12-09 15:25:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:45,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2018-12-09 15:25:45,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-12-09 15:25:45,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2018-12-09 15:25:45,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-12-09 15:25:45,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-12-09 15:25:45,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2018-12-09 15:25:45,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:45,991 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2018-12-09 15:25:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2018-12-09 15:25:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-12-09 15:25:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 15:25:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2018-12-09 15:25:45,994 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-12-09 15:25:45,994 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-12-09 15:25:45,994 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 15:25:45,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2018-12-09 15:25:45,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-12-09 15:25:45,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:45,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:45,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:45,996 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-12-09 15:25:45,996 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-12-09 15:25:45,996 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-12-09 15:25:45,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2018-12-09 15:25:45,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:45,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:45,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1836630604, now seen corresponding path program 1 times [2018-12-09 15:25:46,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:46,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:46,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:46,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:46,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:46,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:25:46,014 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:46,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:46,014 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. cyclomatic complexity: 34 Second operand 3 states. [2018-12-09 15:25:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:46,028 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2018-12-09 15:25:46,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:46,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2018-12-09 15:25:46,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-12-09 15:25:46,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2018-12-09 15:25:46,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-12-09 15:25:46,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-12-09 15:25:46,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2018-12-09 15:25:46,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:46,030 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2018-12-09 15:25:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2018-12-09 15:25:46,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-12-09 15:25:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 15:25:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2018-12-09 15:25:46,032 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-12-09 15:25:46,033 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-12-09 15:25:46,033 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 15:25:46,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2018-12-09 15:25:46,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-12-09 15:25:46,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:46,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:46,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:46,034 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-12-09 15:25:46,034 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-12-09 15:25:46,034 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-12-09 15:25:46,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2018-12-09 15:25:46,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:46,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:46,041 INFO L82 PathProgramCache]: Analyzing trace with hash 331104409, now seen corresponding path program 1 times [2018-12-09 15:25:46,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:46,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:46,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:25:46,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:46,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:46,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:25:46,061 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:46,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:46,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:46,061 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. cyclomatic complexity: 32 Second operand 3 states. [2018-12-09 15:25:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:46,076 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2018-12-09 15:25:46,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:46,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2018-12-09 15:25:46,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-12-09 15:25:46,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 159 transitions. [2018-12-09 15:25:46,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2018-12-09 15:25:46,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-12-09 15:25:46,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 159 transitions. [2018-12-09 15:25:46,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:46,079 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-12-09 15:25:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 159 transitions. [2018-12-09 15:25:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-09 15:25:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-09 15:25:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2018-12-09 15:25:46,084 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-12-09 15:25:46,084 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-12-09 15:25:46,085 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 15:25:46,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 159 transitions. [2018-12-09 15:25:46,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-12-09 15:25:46,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:46,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:46,086 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:46,086 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:46,086 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-12-09 15:25:46,087 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-12-09 15:25:46,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 1 times [2018-12-09 15:25:46,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:46,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:46,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:46,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:46,100 INFO L82 PathProgramCache]: Analyzing trace with hash -62972986, now seen corresponding path program 1 times [2018-12-09 15:25:46,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:46,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:46,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:46,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:46,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:46,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:25:46,135 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:25:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:25:46,136 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. cyclomatic complexity: 36 Second operand 5 states. [2018-12-09 15:25:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:46,190 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2018-12-09 15:25:46,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:25:46,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 346 transitions. [2018-12-09 15:25:46,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 255 [2018-12-09 15:25:46,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 346 transitions. [2018-12-09 15:25:46,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2018-12-09 15:25:46,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2018-12-09 15:25:46,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 346 transitions. [2018-12-09 15:25:46,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:46,195 INFO L705 BuchiCegarLoop]: Abstraction has 275 states and 346 transitions. [2018-12-09 15:25:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 346 transitions. [2018-12-09 15:25:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 134. [2018-12-09 15:25:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 15:25:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2018-12-09 15:25:46,201 INFO L728 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-12-09 15:25:46,201 INFO L608 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-12-09 15:25:46,201 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 15:25:46,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 167 transitions. [2018-12-09 15:25:46,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 117 [2018-12-09 15:25:46,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:46,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:46,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:46,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:46,203 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-12-09 15:25:46,204 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-12-09 15:25:46,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:46,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 2 times [2018-12-09 15:25:46,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:46,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:46,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:46,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:46,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1078264795, now seen corresponding path program 1 times [2018-12-09 15:25:46,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:46,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:25:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:46,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1917816028, now seen corresponding path program 1 times [2018-12-09 15:25:46,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:46,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:46,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:46,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:46,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:46,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:25:46,331 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:25:46,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:25:46,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:25:46,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:25:46,332 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 15:25:46,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:46,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:25:46,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:25:46,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-12-09 15:25:46,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:25:46,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:25:46,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:25:46,463 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:46,467 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:46,467 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:46,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 15:25:46,472 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 /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:46,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:46,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:46,490 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 15:25:46,491 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 /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:46,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:46,506 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:46,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 15:25:46,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:46,542 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 15:25:46,543 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:25:46,544 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:25:46,544 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:25:46,544 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:25:46,544 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:25:46,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:46,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:25:46,544 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:25:46,544 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-12-09 15:25:46,544 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:25:46,544 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:25:46,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:46,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:25:46,684 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:25:46,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,691 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,698 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,698 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:46,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:46,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,721 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-09 15:25:46,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-12-09 15:25:46,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,722 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,722 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,724 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:46,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,730 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,730 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,733 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,733 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:46,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,735 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,736 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,738 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,738 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,740 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,741 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,745 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,745 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,748 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,749 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,751 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,751 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,754 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,755 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,757 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,758 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,759 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-09 15:25:46,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,760 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,761 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,763 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,763 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,764 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:46,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,770 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,773 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,773 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,774 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:46,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,776 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,787 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,787 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,791 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,791 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,793 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,794 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,798 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,801 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,802 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,803 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-09 15:25:46,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,804 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,805 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,807 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,807 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,808 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:46,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,813 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,814 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,817 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,817 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,818 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:46,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,821 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,821 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,823 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,823 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,826 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,826 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,832 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,832 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,836 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,836 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,839 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,839 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,843 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,844 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:46,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,846 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,847 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,848 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-09 15:25:46,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,849 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,849 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,850 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,851 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,852 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,852 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:46,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,860 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,860 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,861 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,864 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,864 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,865 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,865 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:46,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,867 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,867 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,868 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,868 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,870 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,870 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,870 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,871 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,873 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,873 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,874 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,879 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,880 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,880 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,884 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,885 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,885 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,887 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,888 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,888 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,894 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,895 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,895 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,897 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:46,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:46,899 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:46,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,900 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-09 15:25:46,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,901 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,901 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,901 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,902 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,905 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,905 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,905 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,906 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:46,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,915 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,920 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,920 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,920 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,922 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:46,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,924 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,925 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,927 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,927 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,928 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,929 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,931 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,931 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,933 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,967 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,968 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,969 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,974 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,974 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,975 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,977 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,977 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,978 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,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-12-09 15:25:46,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,986 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,986 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,987 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,990 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,990 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:46,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,990 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:46,991 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:46,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,993 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-09 15:25:46,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,994 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:46,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:46,994 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,995 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:46,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:46,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:46,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:46,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:46,997 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:46,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:46,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:46,997 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:46,997 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:46,999 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:47,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,009 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,009 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,010 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,015 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,015 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,015 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,016 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:47,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,019 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,019 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,021 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,022 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,023 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,024 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,025 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,026 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,036 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,036 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,037 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,040 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,040 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,041 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,042 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,042 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,043 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,052 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,052 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,053 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,054 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,054 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,055 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,056 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,056 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-09 15:25:47,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,057 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,057 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,058 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,059 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,059 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,059 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,060 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,063 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,064 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,064 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,066 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,066 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,068 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,068 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,068 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,070 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,070 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,070 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,072 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,072 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,073 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,077 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,079 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,080 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,080 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,082 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,082 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,082 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,084 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,085 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,085 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,085 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,087 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,087 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,088 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,088 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,090 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-09 15:25:47,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,090 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,090 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,090 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,093 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,093 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,094 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 15:25:47,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,101 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,101 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,101 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,104 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,104 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,104 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,104 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 15:25:47,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,106 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,106 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,109 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,109 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,109 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,112 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,112 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,121 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,121 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,121 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,125 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,125 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,128 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,128 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,131 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,132 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,132 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,135 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,135 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,135 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:47,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:47,139 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-12-09 15:25:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:47,168 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2018-12-09 15:25:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:47,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 270 transitions. [2018-12-09 15:25:47,169 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-12-09 15:25:47,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 270 transitions. [2018-12-09 15:25:47,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2018-12-09 15:25:47,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2018-12-09 15:25:47,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 270 transitions. [2018-12-09 15:25:47,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:47,170 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-12-09 15:25:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 270 transitions. [2018-12-09 15:25:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-09 15:25:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-09 15:25:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2018-12-09 15:25:47,174 INFO L728 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-12-09 15:25:47,174 INFO L608 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-12-09 15:25:47,174 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 15:25:47,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 270 transitions. [2018-12-09 15:25:47,175 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-12-09 15:25:47,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:47,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:47,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:47,175 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:47,175 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-12-09 15:25:47,175 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-12-09 15:25:47,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 3 times [2018-12-09 15:25:47,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:47,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:47,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:47,181 INFO L82 PathProgramCache]: Analyzing trace with hash -872319612, now seen corresponding path program 1 times [2018-12-09 15:25:47,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:47,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:25:47,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:47,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:47,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:25:47,218 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:47,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:25:47,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:25:47,219 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. cyclomatic complexity: 54 Second operand 5 states. [2018-12-09 15:25:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:47,260 INFO L93 Difference]: Finished difference Result 428 states and 517 transitions. [2018-12-09 15:25:47,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:25:47,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 517 transitions. [2018-12-09 15:25:47,262 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 387 [2018-12-09 15:25:47,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 428 states and 517 transitions. [2018-12-09 15:25:47,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2018-12-09 15:25:47,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2018-12-09 15:25:47,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 517 transitions. [2018-12-09 15:25:47,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:47,264 INFO L705 BuchiCegarLoop]: Abstraction has 428 states and 517 transitions. [2018-12-09 15:25:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 517 transitions. [2018-12-09 15:25:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 229. [2018-12-09 15:25:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-09 15:25:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2018-12-09 15:25:47,267 INFO L728 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-12-09 15:25:47,267 INFO L608 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-12-09 15:25:47,267 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 15:25:47,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 275 transitions. [2018-12-09 15:25:47,268 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 210 [2018-12-09 15:25:47,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:47,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:47,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:47,269 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:47,269 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-12-09 15:25:47,269 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-12-09 15:25:47,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 4 times [2018-12-09 15:25:47,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:47,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:47,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash -872319550, now seen corresponding path program 1 times [2018-12-09 15:25:47,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:47,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:25:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:47,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:47,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2123761273, now seen corresponding path program 1 times [2018-12-09 15:25:47,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:47,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:47,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:47,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:47,333 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:25:47,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:25:47,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:25:47,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:25:47,333 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 15:25:47,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:47,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:25:47,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:25:47,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-12-09 15:25:47,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:25:47,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:25:47,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,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-12-09 15:25:47,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,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-12-09 15:25:47,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,413 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:25:47,414 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:47,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:47,416 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:47,419 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 15:25:47,419 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 /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:47,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:47,445 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:47,447 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 15:25:47,447 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 /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:47,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:47,464 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:47,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 15:25:47,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:47,504 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 15:25:47,506 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:25:47,506 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:25:47,506 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:25:47,506 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:25:47,506 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:25:47,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:47,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:25:47,507 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:25:47,507 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-12-09 15:25:47,507 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:25:47,507 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:25:47,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:47,612 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:25:47,612 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:25:47,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:47,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:47,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,617 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:47,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:47,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:47,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:47,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,630 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,630 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:47,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,634 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:47,634 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,635 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-09 15:25:47,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,636 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,637 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,639 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,639 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,640 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,644 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,645 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,647 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,647 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,649 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,649 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,651 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,651 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,653 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,653 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,656 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,658 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,658 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,659 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-09 15:25:47,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,660 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,660 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,662 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,664 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,664 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,664 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,667 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,668 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,670 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,670 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,672 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,672 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,674 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,674 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,676 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,676 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,677 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,678 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,679 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,681 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,681 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,682 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-09 15:25:47,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,683 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,683 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,684 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,685 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,686 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,686 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,687 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:47,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,690 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,690 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,692 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,693 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,695 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,695 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,697 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,697 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,699 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,699 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,700 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:47,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,701 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,701 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:47,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,704 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,704 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,704 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:47,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,705 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-09 15:25:47,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,705 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,706 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,706 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,707 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,707 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,708 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,708 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,709 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,709 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,714 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,714 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,715 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,716 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,716 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,717 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,718 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,719 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,719 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,721 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,721 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,721 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,724 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,724 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,727 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,727 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,728 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 15:25:47,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,731 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,731 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 15:25:47,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,734 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-09 15:25:47,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,734 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,735 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,735 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,737 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,737 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,739 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,739 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,739 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,740 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,746 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,746 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,747 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,750 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,750 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,751 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,753 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,753 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,754 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,756 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,757 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,757 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,761 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,761 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,762 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,765 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,766 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,771 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 15:25:47,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,771 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,772 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,774 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-09 15:25:47,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,775 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,776 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,776 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,778 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,778 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,779 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,780 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,780 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,782 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:47,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,790 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,790 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,791 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,793 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,793 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,793 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,795 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,796 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,797 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,798 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,800 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,801 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,805 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,806 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,806 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,807 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:47,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,813 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,814 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 15:25:47,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,824 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,824 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,824 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 15:25:47,825 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 15:25:47,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,831 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-09 15:25:47,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,832 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,832 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,834 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,835 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,837 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,837 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,837 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,838 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,841 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,842 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,842 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,845 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,849 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,850 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,853 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,853 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,854 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,856 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,857 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,857 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,857 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,859 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:25:47,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,863 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 15:25:47,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,863 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 15:25:47,864 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:25:47,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,865 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-09 15:25:47,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-12-09 15:25:47,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,866 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,866 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,869 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,870 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,870 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,873 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,874 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,874 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,874 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 15:25:47,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,882 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,883 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,890 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,890 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,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-12-09 15:25:47,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,897 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,897 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,904 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,905 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,910 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,911 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,911 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,911 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 15:25:47,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,916 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:47,916 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:47,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:47,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:47,921 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 15:25:47,921 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 15:25:47,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:47,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:47,922 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:47,922 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 15:25:47,923 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 15:25:47,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:47,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:48,055 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-12-09 15:25:48,084 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:25:48,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:25:48,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:25:48,085 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:25:48,085 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 15:25:48,085 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:48,085 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:25:48,085 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:25:48,085 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-12-09 15:25:48,085 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:25:48,085 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:25:48,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-12-09 15:25:48,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,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-12-09 15:25:48,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-12-09 15:25:48,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,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-12-09 15:25:48,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,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-12-09 15:25:48,357 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:25:48,357 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:48,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:48,362 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:48,365 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 15:25:48,365 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 /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:48,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:48,390 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:48,392 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 15:25:48,392 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 /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:48,407 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:48,407 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:48,410 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 15:25:48,410 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 /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:48,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:25:48,427 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:48,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 15:25:48,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:25:48,462 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 15:25:48,464 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:25:48,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:25:48,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:25:48,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:25:48,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:25:48,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:25:48,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:25:48,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:25:48,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-12-09 15:25:48,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:25:48,464 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:25:48,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:25:48,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:25:48,657 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:25:48,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:48,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:48,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:48,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:48,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:48,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:48,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:25:48,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:48,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:48,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:48,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:48,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:48,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:48,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:48,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:48,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:48,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:48,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:48,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:48,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:25:48,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:48,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:48,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:48,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:25:48,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:25:48,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:48,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:48,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:48,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:48,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:25:48,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:48,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:25:48,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:25:48,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:25:48,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:25:48,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:25:48,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:25:48,666 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:25:48,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:25:48,667 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 15:25:48,667 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 15:25:48,672 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:25:48,675 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 15:25:48,675 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 15:25:48,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:25:48,678 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-12-09 15:25:48,678 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:25:48,678 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-12-09 15:25:48,681 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-12-09 15:25:48,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:48,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:25:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:48,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:25:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:48,761 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-12-09 15:25:48,762 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50 Second operand 6 states. [2018-12-09 15:25:48,835 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-12-09 15:25:48,835 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-12-09 15:25:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 15:25:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2018-12-09 15:25:48,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 15 letters. [2018-12-09 15:25:48,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:25:48,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 31 letters. Loop has 15 letters. [2018-12-09 15:25:48,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:25:48,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 30 letters. [2018-12-09 15:25:48,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:25:48,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1324 transitions. [2018-12-09 15:25:48,845 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 563 [2018-12-09 15:25:48,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 892 states and 1084 transitions. [2018-12-09 15:25:48,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2018-12-09 15:25:48,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2018-12-09 15:25:48,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1084 transitions. [2018-12-09 15:25:48,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:25:48,849 INFO L705 BuchiCegarLoop]: Abstraction has 892 states and 1084 transitions. [2018-12-09 15:25:48,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1084 transitions. [2018-12-09 15:25:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 659. [2018-12-09 15:25:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-12-09 15:25:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2018-12-09 15:25:48,858 INFO L728 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-12-09 15:25:48,858 INFO L608 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-12-09 15:25:48,858 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 15:25:48,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 802 transitions. [2018-12-09 15:25:48,861 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 377 [2018-12-09 15:25:48,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:48,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:48,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:48,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:48,861 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-12-09 15:25:48,862 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-12-09 15:25:48,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2018-12-09 15:25:48,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:48,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:48,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:48,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:25:48,876 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:25:48,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1691430829, now seen corresponding path program 1 times [2018-12-09 15:25:48,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:48,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:48,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:48,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:48,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:48,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-09 15:25:48,888 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:48,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:48,888 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. cyclomatic complexity: 155 Second operand 3 states. [2018-12-09 15:25:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:48,896 INFO L93 Difference]: Finished difference Result 372 states and 445 transitions. [2018-12-09 15:25:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:48,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 445 transitions. [2018-12-09 15:25:48,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 233 [2018-12-09 15:25:48,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 314 states and 376 transitions. [2018-12-09 15:25:48,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2018-12-09 15:25:48,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2018-12-09 15:25:48,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 376 transitions. [2018-12-09 15:25:48,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:25:48,901 INFO L705 BuchiCegarLoop]: Abstraction has 314 states and 376 transitions. [2018-12-09 15:25:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 376 transitions. [2018-12-09 15:25:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2018-12-09 15:25:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-09 15:25:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 301 transitions. [2018-12-09 15:25:48,905 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-12-09 15:25:48,905 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-12-09 15:25:48,905 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 15:25:48,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 301 transitions. [2018-12-09 15:25:48,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2018-12-09 15:25:48,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:48,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:48,907 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-12-09 15:25:48,907 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:48,907 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-12-09 15:25:48,907 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-12-09 15:25:48,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:48,908 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 1 times [2018-12-09 15:25:48,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:48,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:48,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:48,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:48,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:48,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:25:48,917 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:25:48,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2018-12-09 15:25:48,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:48,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:48,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:48,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:48,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:48,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:25:48,924 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:25:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:48,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:48,924 INFO L87 Difference]: Start difference. First operand 249 states and 301 transitions. cyclomatic complexity: 54 Second operand 3 states. [2018-12-09 15:25:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:48,944 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2018-12-09 15:25:48,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:48,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 364 transitions. [2018-12-09 15:25:48,945 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 258 [2018-12-09 15:25:48,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 364 transitions. [2018-12-09 15:25:48,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2018-12-09 15:25:48,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2018-12-09 15:25:48,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 364 transitions. [2018-12-09 15:25:48,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:25:48,947 INFO L705 BuchiCegarLoop]: Abstraction has 308 states and 364 transitions. [2018-12-09 15:25:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 364 transitions. [2018-12-09 15:25:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 218. [2018-12-09 15:25:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-09 15:25:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2018-12-09 15:25:48,949 INFO L728 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-12-09 15:25:48,949 INFO L608 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-12-09 15:25:48,949 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 15:25:48,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 258 transitions. [2018-12-09 15:25:48,949 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-12-09 15:25:48,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:48,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:48,950 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-12-09 15:25:48,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:48,950 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-12-09 15:25:48,950 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-12-09 15:25:48,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:48,950 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 2 times [2018-12-09 15:25:48,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:48,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:48,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:48,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:25:48,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:25:48,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2018-12-09 15:25:48,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:48,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:48,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:25:48,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:48,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:48,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:48,989 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. cyclomatic complexity: 43 Second operand 3 states. [2018-12-09 15:25:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:48,995 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2018-12-09 15:25:48,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:48,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 282 transitions. [2018-12-09 15:25:48,996 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 190 [2018-12-09 15:25:48,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 240 states and 281 transitions. [2018-12-09 15:25:48,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2018-12-09 15:25:48,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2018-12-09 15:25:48,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 281 transitions. [2018-12-09 15:25:48,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:48,997 INFO L705 BuchiCegarLoop]: Abstraction has 240 states and 281 transitions. [2018-12-09 15:25:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 281 transitions. [2018-12-09 15:25:48,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2018-12-09 15:25:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-09 15:25:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2018-12-09 15:25:48,999 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-12-09 15:25:48,999 INFO L608 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-12-09 15:25:49,000 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 15:25:49,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 256 transitions. [2018-12-09 15:25:49,000 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-12-09 15:25:49,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:49,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:49,001 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-12-09 15:25:49,001 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:49,001 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-12-09 15:25:49,001 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-12-09 15:25:49,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:49,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2034026126, now seen corresponding path program 1 times [2018-12-09 15:25:49,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:49,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:49,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:25:49,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:25:49,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:25:49,009 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:25:49,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:49,009 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 2 times [2018-12-09 15:25:49,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:49,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:49,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:49,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:49,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:25:49,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:25:49,036 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. cyclomatic complexity: 42 Second operand 3 states. [2018-12-09 15:25:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:25:49,045 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2018-12-09 15:25:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:25:49,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 244 transitions. [2018-12-09 15:25:49,046 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-12-09 15:25:49,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 244 transitions. [2018-12-09 15:25:49,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2018-12-09 15:25:49,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2018-12-09 15:25:49,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 244 transitions. [2018-12-09 15:25:49,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:25:49,048 INFO L705 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-12-09 15:25:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 244 transitions. [2018-12-09 15:25:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-12-09 15:25:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-09 15:25:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2018-12-09 15:25:49,051 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-12-09 15:25:49,051 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-12-09 15:25:49,051 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-09 15:25:49,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 244 transitions. [2018-12-09 15:25:49,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-12-09 15:25:49,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:25:49,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:25:49,053 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-12-09 15:25:49,053 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:25:49,053 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-12-09 15:25:49,053 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-12-09 15:25:49,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2018-12-09 15:25:49,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:49,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:49,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:25:49,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:49,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:49,063 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 3 times [2018-12-09 15:25:49,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:49,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:25:49,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:49,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:49,067 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2018-12-09 15:25:49,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:25:49,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:25:49,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:25:49,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:25:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:25:49,283 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2018-12-09 15:25:49,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 03:25:49 BoogieIcfgContainer [2018-12-09 15:25:49,341 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 15:25:49,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:25:49,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:25:49,341 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:25:49,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:45" (3/4) ... [2018-12-09 15:25:49,344 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 15:25:49,388 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_910b86f4-1509-4816-aee7-40c1c19f5bd8/bin-2019/uautomizer/witness.graphml [2018-12-09 15:25:49,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:25:49,389 INFO L168 Benchmark]: Toolchain (without parser) took 4270.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 954.4 MB in the beginning and 948.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 323.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:49,389 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:25:49,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.98 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:49,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.87 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:49,389 INFO L168 Benchmark]: Boogie Preprocessor took 45.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:49,390 INFO L168 Benchmark]: RCFGBuilder took 224.93 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: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:49,390 INFO L168 Benchmark]: BuchiAutomizer took 3775.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 948.8 MB in the end (delta: 158.4 MB). Peak memory consumption was 338.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:25:49,390 INFO L168 Benchmark]: Witness Printer took 46.97 ms. Allocated memory is still 1.3 GB. Free memory was 948.8 MB in the beginning and 948.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-09 15:25:49,391 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.98 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.87 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.93 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: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3775.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 948.8 MB in the end (delta: 158.4 MB). Peak memory consumption was 338.7 MB. Max. memory is 11.5 GB. * Witness Printer took 46.97 ms. Allocated memory is still 1.3 GB. Free memory was 948.8 MB in the beginning and 948.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 3.7s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 848 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s 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, 0.1s 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: 12ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - 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@4a028c9e=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@4951600f=0, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@347f788c=0, tmp=0, q_free=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3143ceb9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22b24d47=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@534d1470=0, p_dw_st=2, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@574f0405=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...