./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/kundu1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu1_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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 532163d21d7e473fbfa4a073427e9fd2a45c7337 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-1dbac8b [2018-11-10 01:33:39,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:33:39,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:33:39,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:33:39,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:33:39,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:33:39,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:33:39,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:33:39,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:33:39,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:33:39,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:33:39,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:33:39,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:33:39,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:33:39,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:33:39,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:33:39,575 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:33:39,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:33:39,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:33:39,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:33:39,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:33:39,579 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:33:39,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:33:39,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:33:39,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:33:39,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:33:39,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:33:39,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:33:39,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:33:39,584 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:33:39,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:33:39,585 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:33:39,585 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:33:39,585 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:33:39,586 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:33:39,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:33:39,586 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 01:33:39,597 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:33:39,597 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:33:39,598 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:33:39,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:33:39,598 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:33:39,598 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 01:33:39,598 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 01:33:39,599 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 01:33:39,599 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 01:33:39,599 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 01:33:39,599 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 01:33:39,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:33:39,599 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:33:39,599 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:33:39,600 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:33:39,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:33:39,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:33:39,600 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 01:33:39,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 01:33:39,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 01:33:39,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:33:39,600 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:33:39,601 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 01:33:39,601 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 01:33:39,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:33:39,601 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:33:39,601 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 01:33:39,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:33:39,601 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:33:39,601 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 01:33:39,602 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 01:33:39,602 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_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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 -> 532163d21d7e473fbfa4a073427e9fd2a45c7337 [2018-11-10 01:33:39,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:33:39,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:33:39,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:33:39,638 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:33:39,638 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:33:39,639 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu1_false-unreach-call_false-termination.cil.c [2018-11-10 01:33:39,680 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/data/1aeecd53c/6c33f8df55334a2192b5d96752e7ef9a/FLAG6f5e58f06 [2018-11-10 01:33:40,082 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:33:40,083 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/sv-benchmarks/c/systemc/kundu1_false-unreach-call_false-termination.cil.c [2018-11-10 01:33:40,088 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/data/1aeecd53c/6c33f8df55334a2192b5d96752e7ef9a/FLAG6f5e58f06 [2018-11-10 01:33:40,097 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/data/1aeecd53c/6c33f8df55334a2192b5d96752e7ef9a [2018-11-10 01:33:40,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:33:40,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:33:40,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:33:40,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:33:40,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:33:40,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368d34bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40, skipping insertion in model container [2018-11-10 01:33:40,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:33:40,132 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:33:40,276 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:33:40,279 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:33:40,308 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:33:40,323 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:33:40,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40 WrapperNode [2018-11-10 01:33:40,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:33:40,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:33:40,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:33:40,324 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:33:40,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:33:40,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:33:40,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:33:40,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:33:40,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... [2018-11-10 01:33:40,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:33:40,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:33:40,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:33:40,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:33:40,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:33:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:33:40,862 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:33:40,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:33:40 BoogieIcfgContainer [2018-11-10 01:33:40,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:33:40,863 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 01:33:40,863 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 01:33:40,866 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 01:33:40,866 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:33:40,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:33:40" (1/3) ... [2018-11-10 01:33:40,867 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d6921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:33:40, skipping insertion in model container [2018-11-10 01:33:40,867 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:33:40,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:40" (2/3) ... [2018-11-10 01:33:40,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d6921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:33:40, skipping insertion in model container [2018-11-10 01:33:40,868 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:33:40,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:33:40" (3/3) ... [2018-11-10 01:33:40,869 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu1_false-unreach-call_false-termination.cil.c [2018-11-10 01:33:40,911 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:33:40,911 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 01:33:40,911 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 01:33:40,911 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 01:33:40,911 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:33:40,912 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:33:40,912 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 01:33:40,912 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:33:40,912 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 01:33:40,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2018-11-10 01:33:40,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 01:33:40,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:40,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:40,949 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] [2018-11-10 01:33:40,949 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] [2018-11-10 01:33:40,949 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 01:33:40,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2018-11-10 01:33:40,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 01:33:40,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:40,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:40,953 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] [2018-11-10 01:33:40,953 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] [2018-11-10 01:33:40,958 INFO L793 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 22#L486true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 5#L219true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 78#L226true assume !(~P_1_i~0 == 1);~P_1_st~0 := 2; 72#L226-2true assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 85#L231-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 9#L321true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 106#L107true assume !(~P_1_pc~0 == 1); 90#L107-2true is_P_1_triggered_~__retres1~0 := 0; 107#L118true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 64#L119true activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 30#L373true assume !(activate_threads_~tmp~1 != 0); 17#L373-2true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 116#L189true assume ~C_1_pc~0 == 1; 70#L190true assume ~e~0 == 1;is_C_1_triggered_~__retres1~1 := 1; 42#L210true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 119#L211true activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 34#L381true assume !(activate_threads_~tmp___1~1 != 0); 35#L381-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 15#L329true assume { :end_inline_reset_delta_events } true; 80#L435-3true [2018-11-10 01:33:40,958 INFO L795 eck$LassoCheckResult]: Loop: 80#L435-3true assume true; 75#L435-1true assume !false; 32#L436true start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 101#L294true assume !true; 11#L310true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 3#L219-1true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 12#L321-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 89#L107-3true assume !(~P_1_pc~0 == 1); 86#L107-5true is_P_1_triggered_~__retres1~0 := 0; 105#L118-1true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 62#L119-1true activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 19#L373-3true assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 23#L373-5true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 108#L189-3true assume ~C_1_pc~0 == 1; 68#L190-1true assume ~e~0 == 1;is_C_1_triggered_~__retres1~1 := 1; 40#L210-1true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 114#L211-1true activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 36#L381-3true assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 26#L381-5true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 18#L329-1true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 120#L244-1true assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 46#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 127#L258-1true start_simulation_#t~ret7 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 95#L454true assume !(start_simulation_~tmp~3 == 0); 83#L454-2true assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 115#L244-2true assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 45#L257-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 125#L258-2true stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 4#L409true assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 69#L416true stop_simulation_#res := stop_simulation_~__retres2~0; 28#L417true start_simulation_#t~ret8 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 126#L467true assume !(start_simulation_~tmp___0~2 != 0); 80#L435-3true [2018-11-10 01:33:40,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:40,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1103808071, now seen corresponding path program 1 times [2018-11-10 01:33:40,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:40,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:40,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:40,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:40,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:41,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:41,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:33:41,057 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 01:33:41,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1366951639, now seen corresponding path program 1 times [2018-11-10 01:33:41,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:41,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:41,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:33:41,067 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:33:41,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:33:41,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:33:41,078 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2018-11-10 01:33:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:41,099 INFO L93 Difference]: Finished difference Result 126 states and 176 transitions. [2018-11-10 01:33:41,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:33:41,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 176 transitions. [2018-11-10 01:33:41,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-11-10 01:33:41,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 119 states and 169 transitions. [2018-11-10 01:33:41,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-11-10 01:33:41,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2018-11-10 01:33:41,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 169 transitions. [2018-11-10 01:33:41,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:41,110 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 169 transitions. [2018-11-10 01:33:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 169 transitions. [2018-11-10 01:33:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-11-10 01:33:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 01:33:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2018-11-10 01:33:41,133 INFO L728 BuchiCegarLoop]: Abstraction has 119 states and 169 transitions. [2018-11-10 01:33:41,133 INFO L608 BuchiCegarLoop]: Abstraction has 119 states and 169 transitions. [2018-11-10 01:33:41,134 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 01:33:41,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 169 transitions. [2018-11-10 01:33:41,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-11-10 01:33:41,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:41,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:41,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:41,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:41,137 INFO L793 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 285#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 268#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 269#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 363#L226-2 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 364#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 277#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 278#L107 assume !(~P_1_pc~0 == 1); 353#L107-2 is_P_1_triggered_~__retres1~0 := 0; 352#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 355#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 310#L373 assume !(activate_threads_~tmp~1 != 0); 288#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 289#L189 assume ~C_1_pc~0 == 1; 361#L190 assume ~e~0 == 1;is_C_1_triggered_~__retres1~1 := 1; 321#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 325#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 315#L381 assume !(activate_threads_~tmp___1~1 != 0); 316#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 286#L329 assume { :end_inline_reset_delta_events } true; 287#L435-3 [2018-11-10 01:33:41,137 INFO L795 eck$LassoCheckResult]: Loop: 287#L435-3 assume true; 367#L435-1 assume !false; 311#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 312#L294 assume true; 378#L269-1 assume !false; 370#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 371#L244 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 330#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 331#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 279#L274 assume !(eval_~tmp___2~0 != 0); 280#L310 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 264#L219-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 265#L321-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 281#L107-3 assume ~P_1_pc~0 == 1; 347#L108-1 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 348#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 350#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 292#L373-3 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 293#L373-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 299#L189-3 assume ~C_1_pc~0 == 1; 359#L190-1 assume ~e~0 == 1;is_C_1_triggered_~__retres1~1 := 1; 323#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 324#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 317#L381-3 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 301#L381-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 290#L329-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 291#L244-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 328#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 377#L454 assume !(start_simulation_~tmp~3 == 0); 372#L454-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 373#L244-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 326#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 327#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 266#L409 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 267#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 304#L417 start_simulation_#t~ret8 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 305#L467 assume !(start_simulation_~tmp___0~2 != 0); 287#L435-3 [2018-11-10 01:33:41,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash 484539831, now seen corresponding path program 1 times [2018-11-10 01:33:41,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:41,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:41,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:33:41,181 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 01:33:41,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1007883372, now seen corresponding path program 1 times [2018-11-10 01:33:41,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:41,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:41,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:41,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:33:41,212 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:33:41,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:33:41,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:33:41,213 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. cyclomatic complexity: 51 Second operand 3 states. [2018-11-10 01:33:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:41,264 INFO L93 Difference]: Finished difference Result 207 states and 284 transitions. [2018-11-10 01:33:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:33:41,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 284 transitions. [2018-11-10 01:33:41,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 184 [2018-11-10 01:33:41,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 284 transitions. [2018-11-10 01:33:41,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-11-10 01:33:41,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2018-11-10 01:33:41,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 284 transitions. [2018-11-10 01:33:41,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:41,268 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 284 transitions. [2018-11-10 01:33:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 284 transitions. [2018-11-10 01:33:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2018-11-10 01:33:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-10 01:33:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 274 transitions. [2018-11-10 01:33:41,276 INFO L728 BuchiCegarLoop]: Abstraction has 199 states and 274 transitions. [2018-11-10 01:33:41,276 INFO L608 BuchiCegarLoop]: Abstraction has 199 states and 274 transitions. [2018-11-10 01:33:41,276 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 01:33:41,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 274 transitions. [2018-11-10 01:33:41,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 176 [2018-11-10 01:33:41,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:41,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:41,278 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] [2018-11-10 01:33:41,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:41,278 INFO L793 eck$LassoCheckResult]: Stem: 712#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 619#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 620#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 603#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 604#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 699#L226-2 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 700#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 612#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 613#L107 assume !(~P_1_pc~0 == 1); 690#L107-2 is_P_1_triggered_~__retres1~0 := 0; 689#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 692#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 645#L373 assume !(activate_threads_~tmp~1 != 0); 623#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 624#L189 assume !(~C_1_pc~0 == 1); 718#L189-2 assume !(~C_1_pc~0 == 2); 655#L199-1 is_C_1_triggered_~__retres1~1 := 0; 656#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 661#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 650#L381 assume !(activate_threads_~tmp___1~1 != 0); 651#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 621#L329 assume { :end_inline_reset_delta_events } true; 622#L435-3 [2018-11-10 01:33:41,279 INFO L795 eck$LassoCheckResult]: Loop: 622#L435-3 assume true; 703#L435-1 assume !false; 646#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 647#L294 assume true; 715#L269-1 assume !false; 706#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 707#L244 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 666#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 667#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 614#L274 assume !(eval_~tmp___2~0 != 0); 615#L310 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 601#L219-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 602#L321-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 616#L107-3 assume ~P_1_pc~0 == 1; 684#L108-1 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 685#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 687#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 627#L373-3 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 628#L373-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 631#L189-3 assume !(~C_1_pc~0 == 1); 717#L189-5 assume !(~C_1_pc~0 == 2); 724#L199-3 is_C_1_triggered_~__retres1~1 := 0; 766#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 762#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 760#L381-3 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 758#L381-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 756#L329-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 752#L244-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 750#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 748#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 745#L454 assume !(start_simulation_~tmp~3 == 0); 708#L454-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 709#L244-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 662#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 663#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 599#L409 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 600#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 639#L417 start_simulation_#t~ret8 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 640#L467 assume !(start_simulation_~tmp___0~2 != 0); 622#L435-3 [2018-11-10 01:33:41,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1818999495, now seen corresponding path program 1 times [2018-11-10 01:33:41,279 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2003883065, now seen corresponding path program 1 times [2018-11-10 01:33:41,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:41,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:41,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:41,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:33:41,343 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:33:41,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:33:41,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:33:41,343 INFO L87 Difference]: Start difference. First operand 199 states and 274 transitions. cyclomatic complexity: 76 Second operand 5 states. [2018-11-10 01:33:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:41,446 INFO L93 Difference]: Finished difference Result 343 states and 466 transitions. [2018-11-10 01:33:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:33:41,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 343 states and 466 transitions. [2018-11-10 01:33:41,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 320 [2018-11-10 01:33:41,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 343 states to 343 states and 466 transitions. [2018-11-10 01:33:41,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 343 [2018-11-10 01:33:41,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 343 [2018-11-10 01:33:41,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 343 states and 466 transitions. [2018-11-10 01:33:41,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:41,452 INFO L705 BuchiCegarLoop]: Abstraction has 343 states and 466 transitions. [2018-11-10 01:33:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states and 466 transitions. [2018-11-10 01:33:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 205. [2018-11-10 01:33:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 01:33:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 280 transitions. [2018-11-10 01:33:41,460 INFO L728 BuchiCegarLoop]: Abstraction has 205 states and 280 transitions. [2018-11-10 01:33:41,460 INFO L608 BuchiCegarLoop]: Abstraction has 205 states and 280 transitions. [2018-11-10 01:33:41,460 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 01:33:41,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 280 transitions. [2018-11-10 01:33:41,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 182 [2018-11-10 01:33:41,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:41,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:41,463 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] [2018-11-10 01:33:41,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:41,463 INFO L793 eck$LassoCheckResult]: Stem: 1285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1178#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 1179#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 1161#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1162#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 1264#L226-2 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 1265#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1170#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1171#L107 assume !(~P_1_pc~0 == 1); 1253#L107-2 is_P_1_triggered_~__retres1~0 := 0; 1252#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1255#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1206#L373 assume !(activate_threads_~tmp~1 != 0); 1182#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1183#L189 assume !(~C_1_pc~0 == 1); 1292#L189-2 assume !(~C_1_pc~0 == 2); 1217#L199-1 is_C_1_triggered_~__retres1~1 := 0; 1218#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1222#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1211#L381 assume !(activate_threads_~tmp___1~1 != 0); 1212#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1180#L329 assume { :end_inline_reset_delta_events } true; 1181#L435-3 [2018-11-10 01:33:41,463 INFO L795 eck$LassoCheckResult]: Loop: 1181#L435-3 assume true; 1268#L435-1 assume !false; 1269#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1229#L294 assume true; 1337#L269-1 assume !false; 1330#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1327#L244 assume !(~P_1_st~0 == 0); 1323#L248 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 1321#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1317#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1306#L274 assume !(eval_~tmp___2~0 != 0); 1307#L310 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 1315#L219-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1174#L321-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1175#L107-3 assume !(~P_1_pc~0 == 1); 1248#L107-5 is_P_1_triggered_~__retres1~0 := 0; 1247#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1314#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1186#L373-3 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 1187#L373-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1290#L189-3 assume !(~C_1_pc~0 == 1); 1291#L189-5 assume !(~C_1_pc~0 == 2); 1305#L199-3 is_C_1_triggered_~__retres1~1 := 0; 1219#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1220#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1213#L381-3 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 1214#L381-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1184#L329-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1185#L244-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 1349#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1348#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1347#L454 assume !(start_simulation_~tmp~3 == 0); 1275#L454-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1276#L244-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 1355#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1354#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 1353#L409 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 1262#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 1200#L417 start_simulation_#t~ret8 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 1201#L467 assume !(start_simulation_~tmp___0~2 != 0); 1181#L435-3 [2018-11-10 01:33:41,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1818999495, now seen corresponding path program 2 times [2018-11-10 01:33:41,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:41,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash 135342666, now seen corresponding path program 1 times [2018-11-10 01:33:41,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:33:41,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:41,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:41,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:33:41,536 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:33:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:33:41,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:33:41,537 INFO L87 Difference]: Start difference. First operand 205 states and 280 transitions. cyclomatic complexity: 76 Second operand 5 states. [2018-11-10 01:33:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:41,635 INFO L93 Difference]: Finished difference Result 554 states and 747 transitions. [2018-11-10 01:33:41,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:33:41,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 554 states and 747 transitions. [2018-11-10 01:33:41,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 510 [2018-11-10 01:33:41,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 554 states to 554 states and 747 transitions. [2018-11-10 01:33:41,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2018-11-10 01:33:41,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 554 [2018-11-10 01:33:41,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 554 states and 747 transitions. [2018-11-10 01:33:41,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:41,646 INFO L705 BuchiCegarLoop]: Abstraction has 554 states and 747 transitions. [2018-11-10 01:33:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states and 747 transitions. [2018-11-10 01:33:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 220. [2018-11-10 01:33:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-10 01:33:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 295 transitions. [2018-11-10 01:33:41,654 INFO L728 BuchiCegarLoop]: Abstraction has 220 states and 295 transitions. [2018-11-10 01:33:41,654 INFO L608 BuchiCegarLoop]: Abstraction has 220 states and 295 transitions. [2018-11-10 01:33:41,654 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 01:33:41,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 295 transitions. [2018-11-10 01:33:41,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 194 [2018-11-10 01:33:41,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:41,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:41,658 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] [2018-11-10 01:33:41,658 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:41,658 INFO L793 eck$LassoCheckResult]: Stem: 2059#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1949#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 1950#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 1933#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1934#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 2034#L226-2 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 2035#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1942#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1943#L107 assume !(~P_1_pc~0 == 1); 2024#L107-2 is_P_1_triggered_~__retres1~0 := 0; 2055#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2148#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1975#L373 assume !(activate_threads_~tmp~1 != 0); 1953#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1954#L189 assume !(~C_1_pc~0 == 1); 2068#L189-2 assume !(~C_1_pc~0 == 2); 1986#L199-1 is_C_1_triggered_~__retres1~1 := 0; 1987#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1991#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1981#L381 assume !(activate_threads_~tmp___1~1 != 0); 1982#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1951#L329 assume { :end_inline_reset_delta_events } true; 1952#L435-3 [2018-11-10 01:33:41,659 INFO L795 eck$LassoCheckResult]: Loop: 1952#L435-3 assume true; 2127#L435-1 assume !false; 2126#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1998#L294 assume true; 2122#L269-1 assume !false; 2120#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2118#L244 assume !(~P_1_st~0 == 0); 2115#L248 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 2114#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2111#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2109#L274 assume !(eval_~tmp___2~0 != 0); 2108#L310 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 2107#L219-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 2106#L321-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2052#L107-3 assume ~P_1_pc~0 == 1; 2053#L108-1 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 2104#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2102#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2100#L373-3 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 1964#L373-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1965#L189-3 assume !(~C_1_pc~0 == 1); 2067#L189-5 assume !(~C_1_pc~0 == 2); 2076#L199-3 is_C_1_triggered_~__retres1~1 := 0; 2124#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2123#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2121#L381-3 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 2119#L381-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2117#L329-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2112#L244-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 2110#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2098#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 2060#L454 assume !(start_simulation_~tmp~3 == 0); 2061#L454-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2136#L244-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 2135#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2134#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 2133#L409 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 2132#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 2131#L417 start_simulation_#t~ret8 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2129#L467 assume !(start_simulation_~tmp___0~2 != 0); 1952#L435-3 [2018-11-10 01:33:41,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1818999495, now seen corresponding path program 3 times [2018-11-10 01:33:41,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:41,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,678 INFO L82 PathProgramCache]: Analyzing trace with hash -503441813, now seen corresponding path program 1 times [2018-11-10 01:33:41,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:33:41,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:41,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:41,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:33:41,737 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:33:41,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:33:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:33:41,737 INFO L87 Difference]: Start difference. First operand 220 states and 295 transitions. cyclomatic complexity: 76 Second operand 5 states. [2018-11-10 01:33:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:41,824 INFO L93 Difference]: Finished difference Result 460 states and 617 transitions. [2018-11-10 01:33:41,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:33:41,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 460 states and 617 transitions. [2018-11-10 01:33:41,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 434 [2018-11-10 01:33:41,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 460 states to 460 states and 617 transitions. [2018-11-10 01:33:41,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 460 [2018-11-10 01:33:41,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 460 [2018-11-10 01:33:41,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 460 states and 617 transitions. [2018-11-10 01:33:41,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:41,834 INFO L705 BuchiCegarLoop]: Abstraction has 460 states and 617 transitions. [2018-11-10 01:33:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states and 617 transitions. [2018-11-10 01:33:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 226. [2018-11-10 01:33:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-10 01:33:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 298 transitions. [2018-11-10 01:33:41,841 INFO L728 BuchiCegarLoop]: Abstraction has 226 states and 298 transitions. [2018-11-10 01:33:41,841 INFO L608 BuchiCegarLoop]: Abstraction has 226 states and 298 transitions. [2018-11-10 01:33:41,841 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 01:33:41,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 298 transitions. [2018-11-10 01:33:41,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 200 [2018-11-10 01:33:41,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:41,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:41,843 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] [2018-11-10 01:33:41,843 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:41,844 INFO L793 eck$LassoCheckResult]: Stem: 2742#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2643#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 2644#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 2627#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2628#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 2725#L226-2 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 2726#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2636#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2637#L107 assume !(~P_1_pc~0 == 1); 2715#L107-2 is_P_1_triggered_~__retres1~0 := 0; 2739#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2716#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2670#L373 assume !(activate_threads_~tmp~1 != 0); 2647#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2648#L189 assume !(~C_1_pc~0 == 1); 2749#L189-2 assume !(~C_1_pc~0 == 2); 2681#L199-1 is_C_1_triggered_~__retres1~1 := 0; 2682#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2687#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2676#L381 assume !(activate_threads_~tmp___1~1 != 0); 2677#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2645#L329 assume { :end_inline_reset_delta_events } true; 2646#L435-3 [2018-11-10 01:33:41,844 INFO L795 eck$LassoCheckResult]: Loop: 2646#L435-3 assume true; 2729#L435-1 assume !false; 2672#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2673#L294 assume true; 2745#L269-1 assume !false; 2733#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2734#L244 assume !(~P_1_st~0 == 0); 2731#L248 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 2732#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2841#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2839#L274 assume !(eval_~tmp___2~0 != 0); 2639#L310 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 2623#L219-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 2624#L321-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2640#L107-3 assume ~P_1_pc~0 == 1; 2709#L108-1 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 2710#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2785#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2782#L373-3 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 2652#L373-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2747#L189-3 assume !(~C_1_pc~0 == 1); 2748#L189-5 assume !(~C_1_pc~0 == 2); 2756#L199-3 is_C_1_triggered_~__retres1~1 := 0; 2778#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2777#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2776#L381-3 assume !(activate_threads_~tmp___1~1 != 0); 2775#L381-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2774#L329-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2772#L244-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 2771#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2770#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 2769#L454 assume !(start_simulation_~tmp~3 == 0); 2735#L454-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2736#L244-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 2688#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2689#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 2625#L409 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 2626#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 2665#L417 start_simulation_#t~ret8 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2666#L467 assume !(start_simulation_~tmp___0~2 != 0); 2646#L435-3 [2018-11-10 01:33:41,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1818999495, now seen corresponding path program 4 times [2018-11-10 01:33:41,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1783305491, now seen corresponding path program 1 times [2018-11-10 01:33:41,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:33:41,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:41,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:41,875 INFO L82 PathProgramCache]: Analyzing trace with hash 507504563, now seen corresponding path program 1 times [2018-11-10 01:33:41,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:41,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:41,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:41,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:33:42,048 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-10 01:33:42,092 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:33:42,093 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:33:42,093 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:33:42,093 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:33:42,093 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:33:42,093 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,093 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:33:42,094 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:33:42,094 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 01:33:42,094 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:33:42,094 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:33:42,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,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-11-10 01:33:42,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,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-11-10 01:33:42,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,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-11-10 01:33:42,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-11-10 01:33:42,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,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-11-10 01:33:42,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,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-11-10 01:33:42,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,290 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:33:42,291 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,299 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,299 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,326 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,328 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,328 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,348 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,350 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,350 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,372 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,372 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_C_1_triggered_#res=0, ULTIMATE.start_activate_threads_~tmp___1~1=0, ULTIMATE.start_is_C_1_triggered_~__retres1~1=0} Honda state: {ULTIMATE.start_is_C_1_triggered_#res=0, ULTIMATE.start_activate_threads_~tmp___1~1=0, ULTIMATE.start_is_C_1_triggered_~__retres1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,397 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,397 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret6=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,415 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,419 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,419 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,437 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,439 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,439 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,459 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,459 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet2=0} Honda state: {ULTIMATE.start_eval_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,493 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,494 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,496 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,496 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,514 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,516 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,516 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,533 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,533 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,537 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,537 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp~1=1, ULTIMATE.start_is_P_1_triggered_~__retres1~0=1, ULTIMATE.start_is_P_1_triggered_#res=1} Honda state: {ULTIMATE.start_activate_threads_~tmp~1=1, ULTIMATE.start_is_P_1_triggered_~__retres1~0=1, ULTIMATE.start_is_P_1_triggered_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,553 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,569 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,569 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_1_pc~0=1} Honda state: {~P_1_pc~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/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-11-10 01:33:42,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,572 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,574 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,574 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret7=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,590 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,592 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,592 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,625 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,625 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_1_ev~0=1} Honda state: {~P_1_ev~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,631 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,632 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,648 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,650 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,650 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~C_1_st~0=7} Honda state: {~C_1_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,670 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,670 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~C_1_pc~0=-8} Honda state: {~C_1_pc~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,689 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,689 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~tmp___0~2=0, ULTIMATE.start_stop_simulation_~__retres2~0=0, ULTIMATE.start_stop_simulation_#res=0} Honda state: {ULTIMATE.start_start_simulation_~tmp___0~2=0, ULTIMATE.start_stop_simulation_~__retres2~0=0, ULTIMATE.start_stop_simulation_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,706 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,721 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,721 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~tmp~3=1} Honda state: {ULTIMATE.start_start_simulation_~tmp~3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,729 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,729 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,761 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:33:42,761 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:33:42,764 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:33:42,783 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:33:42,806 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:33:42,807 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:33:42,807 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:33:42,807 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:33:42,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:33:42,807 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:33:42,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:33:42,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:33:42,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:33:42,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 01:33:42,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:33:42,807 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:33:42,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:42,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:33:43,012 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:33:43,016 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:33:43,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,080 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,080 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,082 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,083 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,096 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,097 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:33:43,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:33:43,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,101 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 01:33:43,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,103 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,103 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,105 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,105 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,107 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,108 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,110 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,110 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,111 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,112 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,112 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,114 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,115 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,115 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,117 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,117 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,119 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,121 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,121 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,125 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,125 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,127 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,127 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,129 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,129 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,133 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,134 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,136 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,137 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,138 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,139 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,141 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,141 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,144 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,144 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,146 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,146 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,151 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,151 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,153 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,154 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,159 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,159 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,164 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,164 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,165 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 01:33:43,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,166 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,166 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,168 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,168 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,171 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,171 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,173 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,173 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,175 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,177 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,178 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,179 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,181 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,182 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,184 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,186 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,186 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,188 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,188 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,190 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,190 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,192 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,193 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,197 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,197 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,200 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,201 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,202 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,203 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,205 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,206 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,206 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:33:43,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,208 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,208 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,208 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:33:43,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,210 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,211 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,215 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,215 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,218 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,219 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,222 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,222 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,223 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,224 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,224 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:33:43,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,229 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,229 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,230 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 01:33:43,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,231 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,231 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,233 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,233 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,236 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,236 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,238 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,238 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,240 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,240 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,243 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,243 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,244 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,245 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,245 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,247 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,247 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,249 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,249 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,251 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,251 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,253 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,254 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,255 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,256 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,258 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,258 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,266 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,267 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,274 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,274 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,277 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,277 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,281 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,281 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,281 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:33:43,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,285 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,285 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,285 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:33:43,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,288 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,288 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,295 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,296 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,299 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,301 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,305 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,305 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,307 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,307 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,307 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:33:43,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:33:43,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,314 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,315 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,316 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 01:33:43,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,316 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,317 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,317 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,319 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,320 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,320 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,322 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,323 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,324 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,326 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,326 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,326 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,326 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,328 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,329 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,329 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,332 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,332 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,333 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,333 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,335 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,335 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,336 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,337 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,338 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,338 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,339 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,339 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,341 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,341 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,341 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,345 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,345 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,346 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,348 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,348 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,348 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,350 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,350 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,350 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,351 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,354 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,354 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,355 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,362 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,363 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,363 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,364 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,368 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,368 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,368 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,369 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,370 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,370 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,371 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,372 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,376 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,376 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,376 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,376 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,381 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,381 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,381 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,381 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,386 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,387 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,388 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,389 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,397 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,397 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,398 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,398 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,402 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,402 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,403 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,406 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,407 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,407 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,409 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,409 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,409 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,409 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,416 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,416 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,417 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:33:43,417 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:33:43,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,418 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 01:33:43,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,419 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,420 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,420 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,422 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,423 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,423 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,424 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,427 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,427 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,428 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,430 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,430 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,431 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,431 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,433 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,433 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,434 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,435 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,439 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,439 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,439 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,441 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,442 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,442 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,445 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,446 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,446 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,448 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,449 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,449 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,451 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,451 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,451 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,453 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,454 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,454 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,456 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,457 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,457 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,457 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,460 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,460 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,460 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,461 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,472 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,472 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,472 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,473 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,477 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,478 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,480 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,481 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,481 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,486 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,486 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,486 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,487 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:33:43,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,494 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,494 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,494 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,495 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:33:43,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,501 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,501 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,502 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,517 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,517 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,518 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,524 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,524 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,524 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,525 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,530 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,530 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,531 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,531 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,533 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,533 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,534 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,534 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,535 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:33:43,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,543 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,543 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:33:43,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,544 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,545 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,547 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 01:33:43,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,548 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,548 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,549 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,551 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,552 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,554 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,557 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,557 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,557 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,558 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,561 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,562 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,565 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,565 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,567 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,570 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,570 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,571 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,574 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,574 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,575 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,578 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,578 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,579 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,582 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,582 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,583 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,586 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,586 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,587 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,589 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,590 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,590 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,591 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,594 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,594 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,595 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,598 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,598 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,600 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,613 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,614 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,615 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,622 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,622 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,622 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,623 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,626 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,626 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,626 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,628 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,634 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,635 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,635 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,637 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:33:43,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,646 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,647 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,647 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,649 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:33:43,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,657 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,657 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,658 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,660 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,670 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,671 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,672 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,679 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,679 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,681 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,687 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,688 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,689 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,691 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,691 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,692 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,694 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:33:43,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,705 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,706 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:33:43,707 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:33:43,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,708 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 01:33:43,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-11-10 01:33:43,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,709 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,710 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,710 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,713 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,714 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,719 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,719 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,720 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,723 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,723 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,724 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,727 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,727 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,728 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,732 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,733 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,733 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,736 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,737 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,740 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,740 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,744 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,744 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,744 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,745 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,747 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,748 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,748 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,751 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,752 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,752 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,755 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,755 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,756 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,768 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,770 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,782 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,782 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,791 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,792 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,796 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,796 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,796 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,797 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:33:43,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,857 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,857 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,857 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,858 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,858 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:33:43,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,861 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,862 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,862 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,873 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,874 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,874 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,879 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,880 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,884 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,888 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,888 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:43,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,889 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:33:43,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,894 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:33:43,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,895 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:33:43,895 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:33:43,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,900 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 01:33:43,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-11-10 01:33:43,901 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,901 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,901 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,906 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,907 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,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-11-10 01:33:43,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,914 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,915 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,923 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,925 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,928 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,929 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,938 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,938 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,942 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,942 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,942 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,946 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,946 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,951 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,951 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,955 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,957 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,968 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,969 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,973 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,973 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,979 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,980 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,980 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:43,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:43,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:43,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:43,998 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:43,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:43,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:43,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:43,998 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:43,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:43,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:44,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,009 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:44,010 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:44,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:44,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,014 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:44,014 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:44,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,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-11-10 01:33:44,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,018 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:44,019 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,019 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:33:44,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,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-11-10 01:33:44,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,024 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,024 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:44,025 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,025 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:33:44,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:44,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,030 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:44,030 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:44,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:44,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,054 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:44,054 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:44,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:44,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,064 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:44,064 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:44,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:44,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,069 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:44,070 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:44,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:44,073 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,073 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,074 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:33:44,074 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,075 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:33:44,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:33:44,084 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:33:44,084 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:33:44,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:33:44,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:33:44,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:33:44,084 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:33:44,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:33:44,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:33:44,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:33:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:33:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:33:44,088 INFO L87 Difference]: Start difference. First operand 226 states and 298 transitions. cyclomatic complexity: 73 Second operand 3 states. [2018-11-10 01:33:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:44,368 INFO L93 Difference]: Finished difference Result 368 states and 476 transitions. [2018-11-10 01:33:44,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:33:44,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 368 states and 476 transitions. [2018-11-10 01:33:44,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 342 [2018-11-10 01:33:44,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 368 states to 368 states and 476 transitions. [2018-11-10 01:33:44,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2018-11-10 01:33:44,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2018-11-10 01:33:44,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 476 transitions. [2018-11-10 01:33:44,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:44,374 INFO L705 BuchiCegarLoop]: Abstraction has 368 states and 476 transitions. [2018-11-10 01:33:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 476 transitions. [2018-11-10 01:33:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-11-10 01:33:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-10 01:33:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 476 transitions. [2018-11-10 01:33:44,382 INFO L728 BuchiCegarLoop]: Abstraction has 368 states and 476 transitions. [2018-11-10 01:33:44,382 INFO L608 BuchiCegarLoop]: Abstraction has 368 states and 476 transitions. [2018-11-10 01:33:44,382 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 01:33:44,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 368 states and 476 transitions. [2018-11-10 01:33:44,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 342 [2018-11-10 01:33:44,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:44,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:44,391 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] [2018-11-10 01:33:44,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:44,391 INFO L793 eck$LassoCheckResult]: Stem: 3350#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 3245#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 3229#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3230#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 3330#L226-2 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 3331#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 3237#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3238#L107 assume !(~P_1_pc~0 == 1); 3317#L107-2 is_P_1_triggered_~__retres1~0 := 0; 3347#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3319#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3271#L373 assume !(activate_threads_~tmp~1 != 0); 3248#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3249#L189 assume !(~C_1_pc~0 == 1); 3360#L189-2 assume !(~C_1_pc~0 == 2); 3281#L199-1 is_C_1_triggered_~__retres1~1 := 0; 3282#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3287#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3276#L381 assume !(activate_threads_~tmp___1~1 != 0); 3277#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3246#L329 assume { :end_inline_reset_delta_events } true; 3247#L435-3 [2018-11-10 01:33:44,391 INFO L795 eck$LassoCheckResult]: Loop: 3247#L435-3 assume true; 3335#L435-1 assume !false; 3272#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 3273#L294 assume true; 3355#L269-1 assume !false; 3341#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3342#L244 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 3292#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3293#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3239#L274 assume eval_~tmp___2~0 != 0; 3233#L274-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 3234#L283 assume eval_~tmp~0 != 0;~P_1_st~0 := 1;assume { :begin_inline_P_1 } true; 3298#L72 assume ~P_1_pc~0 == 0; 3254#L76 assume true; 3255#L83 assume !(~i~0 < ~max_loop~0); 3274#L95 ~P_1_st~0 := 2; 3275#L99 assume { :end_inline_P_1 } true; 3354#L279 assume !(~C_1_st~0 == 0); 3390#L294 assume true; 3382#L269-1 assume !false; 3383#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3375#L244 assume !(~P_1_st~0 == 0); 3376#L248 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 3449#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3448#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3447#L274 assume !(eval_~tmp___2~0 != 0); 3240#L310 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 3227#L219-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 3228#L321-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3241#L107-3 assume !(~P_1_pc~0 == 1); 3313#L107-5 is_P_1_triggered_~__retres1~0 := 0; 3345#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3314#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3252#L373-3 assume !(activate_threads_~tmp~1 != 0); 3253#L373-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3418#L189-3 assume !(~C_1_pc~0 == 1); 3397#L189-5 assume !(~C_1_pc~0 == 2); 3398#L199-3 is_C_1_triggered_~__retres1~1 := 0; 3563#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3562#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3561#L381-3 assume !(activate_threads_~tmp___1~1 != 0); 3560#L381-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3559#L329-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3374#L244-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 3290#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3291#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 3351#L454 assume !(start_simulation_~tmp~3 == 0); 3343#L454-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3344#L244-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 3288#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3289#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 3225#L409 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 3226#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 3265#L417 start_simulation_#t~ret8 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 3266#L467 assume !(start_simulation_~tmp___0~2 != 0); 3247#L435-3 [2018-11-10 01:33:44,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1818999495, now seen corresponding path program 5 times [2018-11-10 01:33:44,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:44,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1372268056, now seen corresponding path program 1 times [2018-11-10 01:33:44,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:33:44,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:44,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:44,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:33:44,524 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:33:44,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:33:44,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:33:44,524 INFO L87 Difference]: Start difference. First operand 368 states and 476 transitions. cyclomatic complexity: 109 Second operand 4 states. [2018-11-10 01:33:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:44,573 INFO L93 Difference]: Finished difference Result 368 states and 468 transitions. [2018-11-10 01:33:44,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:33:44,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 368 states and 468 transitions. [2018-11-10 01:33:44,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 342 [2018-11-10 01:33:44,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 368 states to 368 states and 468 transitions. [2018-11-10 01:33:44,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2018-11-10 01:33:44,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2018-11-10 01:33:44,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 468 transitions. [2018-11-10 01:33:44,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:44,580 INFO L705 BuchiCegarLoop]: Abstraction has 368 states and 468 transitions. [2018-11-10 01:33:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 468 transitions. [2018-11-10 01:33:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-11-10 01:33:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-10 01:33:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 468 transitions. [2018-11-10 01:33:44,586 INFO L728 BuchiCegarLoop]: Abstraction has 368 states and 468 transitions. [2018-11-10 01:33:44,586 INFO L608 BuchiCegarLoop]: Abstraction has 368 states and 468 transitions. [2018-11-10 01:33:44,586 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 01:33:44,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 368 states and 468 transitions. [2018-11-10 01:33:44,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 342 [2018-11-10 01:33:44,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:44,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:44,589 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] [2018-11-10 01:33:44,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:44,589 INFO L793 eck$LassoCheckResult]: Stem: 4093#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3987#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 3988#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 3972#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3973#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 4073#L226-2 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 4074#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 3980#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3981#L107 assume !(~P_1_pc~0 == 1); 4061#L107-2 is_P_1_triggered_~__retres1~0 := 0; 4090#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4062#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4013#L373 assume !(activate_threads_~tmp~1 != 0); 3991#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3992#L189 assume !(~C_1_pc~0 == 1); 4102#L189-2 assume !(~C_1_pc~0 == 2); 4024#L199-1 is_C_1_triggered_~__retres1~1 := 0; 4025#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 4030#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4019#L381 assume !(activate_threads_~tmp___1~1 != 0); 4020#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3989#L329 assume { :end_inline_reset_delta_events } true; 3990#L435-3 [2018-11-10 01:33:44,589 INFO L795 eck$LassoCheckResult]: Loop: 3990#L435-3 assume true; 4078#L435-1 assume !false; 4015#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 4016#L294 assume true; 4099#L269-1 assume !false; 4084#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4085#L244 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 4108#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4335#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 4334#L274 assume eval_~tmp___2~0 != 0; 4333#L274-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 4098#L283 assume eval_~tmp~0 != 0;~P_1_st~0 := 1;assume { :begin_inline_P_1 } true; 4041#L72 assume ~P_1_pc~0 == 0; 3997#L76 assume true; 3998#L83 assume !(~i~0 < ~max_loop~0); 4017#L95 ~P_1_st~0 := 2; 4018#L99 assume { :end_inline_P_1 } true; 3977#L279 assume !(~C_1_st~0 == 0); 4191#L294 assume true; 4190#L269-1 assume !false; 4189#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4188#L244 assume !(~P_1_st~0 == 0); 4187#L248 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~2 := 0; 4186#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4185#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 4184#L274 assume !(eval_~tmp___2~0 != 0); 3983#L310 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 3968#L219-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 3969#L321-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3984#L107-3 assume ~P_1_pc~0 == 1; 4054#L108-1 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 4055#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4057#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4058#L373-3 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 4002#L373-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 4003#L189-3 assume !(~C_1_pc~0 == 1); 4101#L189-5 assume !(~C_1_pc~0 == 2); 4040#L199-3 is_C_1_triggered_~__retres1~1 := 0; 4028#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 4029#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4021#L381-3 assume !(activate_threads_~tmp___1~1 != 0); 4005#L381-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3993#L329-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3994#L244-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 4033#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4034#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 4094#L454 assume !(start_simulation_~tmp~3 == 0); 4086#L454-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4087#L244-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 4031#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4032#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 3970#L409 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 3971#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 4008#L417 start_simulation_#t~ret8 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 4009#L467 assume !(start_simulation_~tmp___0~2 != 0); 3990#L435-3 [2018-11-10 01:33:44,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1818999495, now seen corresponding path program 6 times [2018-11-10 01:33:44,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2065060043, now seen corresponding path program 1 times [2018-11-10 01:33:44,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:33:44,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:44,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:44,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:33:44,631 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:33:44,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:33:44,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:33:44,631 INFO L87 Difference]: Start difference. First operand 368 states and 468 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-11-10 01:33:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:44,660 INFO L93 Difference]: Finished difference Result 591 states and 744 transitions. [2018-11-10 01:33:44,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:33:44,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 591 states and 744 transitions. [2018-11-10 01:33:44,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 560 [2018-11-10 01:33:44,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 591 states to 591 states and 744 transitions. [2018-11-10 01:33:44,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 591 [2018-11-10 01:33:44,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 591 [2018-11-10 01:33:44,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 591 states and 744 transitions. [2018-11-10 01:33:44,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:44,668 INFO L705 BuchiCegarLoop]: Abstraction has 591 states and 744 transitions. [2018-11-10 01:33:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states and 744 transitions. [2018-11-10 01:33:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 583. [2018-11-10 01:33:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-11-10 01:33:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 734 transitions. [2018-11-10 01:33:44,676 INFO L728 BuchiCegarLoop]: Abstraction has 583 states and 734 transitions. [2018-11-10 01:33:44,676 INFO L608 BuchiCegarLoop]: Abstraction has 583 states and 734 transitions. [2018-11-10 01:33:44,676 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 01:33:44,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 583 states and 734 transitions. [2018-11-10 01:33:44,679 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 552 [2018-11-10 01:33:44,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:44,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:44,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:44,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:44,680 INFO L793 eck$LassoCheckResult]: Stem: 5059#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 4952#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 4953#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 4937#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 4938#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 5037#L226-2 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 5038#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 4945#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4946#L107 assume !(~P_1_pc~0 == 1); 5055#L107-2 is_P_1_triggered_~__retres1~0 := 0; 5056#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5026#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4978#L373 assume !(activate_threads_~tmp~1 != 0); 4956#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 4957#L189 assume !(~C_1_pc~0 == 1); 5065#L189-2 assume !(~C_1_pc~0 == 2); 4989#L199-1 is_C_1_triggered_~__retres1~1 := 0; 4990#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 4995#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4984#L381 assume !(activate_threads_~tmp___1~1 != 0); 4985#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4954#L329 assume { :end_inline_reset_delta_events } true; 4955#L435-3 assume true; 5041#L435-1 assume !false; 5042#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 5003#L294 [2018-11-10 01:33:44,680 INFO L795 eck$LassoCheckResult]: Loop: 5003#L294 assume true; 5508#L269-1 assume !false; 5507#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5506#L244 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 5505#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5504#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 4947#L274 assume eval_~tmp___2~0 != 0; 4941#L274-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 4942#L283 assume !(eval_~tmp~0 != 0); 5002#L279 assume !(~C_1_st~0 == 0); 5003#L294 [2018-11-10 01:33:44,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,680 INFO L82 PathProgramCache]: Analyzing trace with hash 211667505, now seen corresponding path program 1 times [2018-11-10 01:33:44,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:44,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1371297112, now seen corresponding path program 1 times [2018-11-10 01:33:44,696 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:44,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1165068072, now seen corresponding path program 1 times [2018-11-10 01:33:44,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:44,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:44,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:33:44,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:33:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:33:44,762 INFO L87 Difference]: Start difference. First operand 583 states and 734 transitions. cyclomatic complexity: 154 Second operand 3 states. [2018-11-10 01:33:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:44,798 INFO L93 Difference]: Finished difference Result 919 states and 1131 transitions. [2018-11-10 01:33:44,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:33:44,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 919 states and 1131 transitions. [2018-11-10 01:33:44,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 863 [2018-11-10 01:33:44,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 919 states to 919 states and 1131 transitions. [2018-11-10 01:33:44,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 919 [2018-11-10 01:33:44,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 919 [2018-11-10 01:33:44,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 919 states and 1131 transitions. [2018-11-10 01:33:44,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:44,808 INFO L705 BuchiCegarLoop]: Abstraction has 919 states and 1131 transitions. [2018-11-10 01:33:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states and 1131 transitions. [2018-11-10 01:33:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919. [2018-11-10 01:33:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-11-10 01:33:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1131 transitions. [2018-11-10 01:33:44,820 INFO L728 BuchiCegarLoop]: Abstraction has 919 states and 1131 transitions. [2018-11-10 01:33:44,821 INFO L608 BuchiCegarLoop]: Abstraction has 919 states and 1131 transitions. [2018-11-10 01:33:44,821 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 01:33:44,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 919 states and 1131 transitions. [2018-11-10 01:33:44,824 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 863 [2018-11-10 01:33:44,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:44,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:44,824 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:44,825 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:44,825 INFO L793 eck$LassoCheckResult]: Stem: 6575#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 6464#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 6465#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 6447#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 6448#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 6550#L226-2 assume !(~C_1_i~0 == 1);~C_1_st~0 := 2; 6551#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 6456#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6457#L107 assume !(~P_1_pc~0 == 1); 6571#L107-2 is_P_1_triggered_~__retres1~0 := 0; 6572#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6541#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6490#L373 assume !(activate_threads_~tmp~1 != 0); 6468#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 6469#L189 assume !(~C_1_pc~0 == 1); 6583#L189-2 assume !(~C_1_pc~0 == 2); 6502#L199-1 is_C_1_triggered_~__retres1~1 := 0; 6503#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 6507#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6495#L381 assume !(activate_threads_~tmp___1~1 != 0); 6496#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6497#L329 assume { :end_inline_reset_delta_events } true; 6737#L435-3 assume true; 6735#L435-1 assume !false; 6724#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 6718#L294 [2018-11-10 01:33:44,825 INFO L795 eck$LassoCheckResult]: Loop: 6718#L294 assume true; 6719#L269-1 assume !false; 6712#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6713#L244 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 6705#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6706#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 6698#L274 assume eval_~tmp___2~0 != 0; 6699#L274-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 6691#L283 assume !(eval_~tmp~0 != 0); 6693#L279 assume !(~C_1_st~0 == 0); 6718#L294 [2018-11-10 01:33:44,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,825 INFO L82 PathProgramCache]: Analyzing trace with hash -605980945, now seen corresponding path program 1 times [2018-11-10 01:33:44,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:44,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:44,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:44,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:33:44,849 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 01:33:44,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1371297112, now seen corresponding path program 2 times [2018-11-10 01:33:44,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:44,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:33:44,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:33:44,885 INFO L87 Difference]: Start difference. First operand 919 states and 1131 transitions. cyclomatic complexity: 215 Second operand 3 states. [2018-11-10 01:33:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:44,903 INFO L93 Difference]: Finished difference Result 900 states and 1111 transitions. [2018-11-10 01:33:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:33:44,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 900 states and 1111 transitions. [2018-11-10 01:33:44,907 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 863 [2018-11-10 01:33:44,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 900 states to 900 states and 1111 transitions. [2018-11-10 01:33:44,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 900 [2018-11-10 01:33:44,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 900 [2018-11-10 01:33:44,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 900 states and 1111 transitions. [2018-11-10 01:33:44,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:33:44,912 INFO L705 BuchiCegarLoop]: Abstraction has 900 states and 1111 transitions. [2018-11-10 01:33:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states and 1111 transitions. [2018-11-10 01:33:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2018-11-10 01:33:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-10 01:33:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1111 transitions. [2018-11-10 01:33:44,922 INFO L728 BuchiCegarLoop]: Abstraction has 900 states and 1111 transitions. [2018-11-10 01:33:44,922 INFO L608 BuchiCegarLoop]: Abstraction has 900 states and 1111 transitions. [2018-11-10 01:33:44,922 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 01:33:44,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 900 states and 1111 transitions. [2018-11-10 01:33:44,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 863 [2018-11-10 01:33:44,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:33:44,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:33:44,926 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:44,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:44,926 INFO L793 eck$LassoCheckResult]: Stem: 8393#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 8288#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 8289#L486 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 8272#L219 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 8273#L226 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 8371#L226-2 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 8372#L231-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 8281#L321 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8282#L107 assume !(~P_1_pc~0 == 1); 8389#L107-2 is_P_1_triggered_~__retres1~0 := 0; 8390#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8362#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 8313#L373 assume !(activate_threads_~tmp~1 != 0); 8292#L373-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 8293#L189 assume !(~C_1_pc~0 == 1); 8401#L189-2 assume !(~C_1_pc~0 == 2); 8325#L199-1 is_C_1_triggered_~__retres1~1 := 0; 8326#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 8331#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8319#L381 assume !(activate_threads_~tmp___1~1 != 0); 8320#L381-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 8290#L329 assume { :end_inline_reset_delta_events } true; 8291#L435-3 assume true; 8374#L435-1 assume !false; 8317#L436 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 8318#L294 [2018-11-10 01:33:44,926 INFO L795 eck$LassoCheckResult]: Loop: 8318#L294 assume true; 8413#L269-1 assume !false; 8380#L270 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8381#L244 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~2 := 1; 8336#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8337#L258 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8280#L274 assume eval_~tmp___2~0 != 0; 8276#L274-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 8277#L283 assume !(eval_~tmp~0 != 0); 8396#L279 assume ~C_1_st~0 == 0;eval_~tmp___1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 8891#L298 assume !(eval_~tmp___1~0 != 0); 8318#L294 [2018-11-10 01:33:44,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 211667505, now seen corresponding path program 2 times [2018-11-10 01:33:44,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:33:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash 439460303, now seen corresponding path program 1 times [2018-11-10 01:33:44,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:33:44,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:44,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1757374049, now seen corresponding path program 1 times [2018-11-10 01:33:44,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:33:44,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:33:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:44,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:33:45,174 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-10 01:33:45,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:33:45 BoogieIcfgContainer [2018-11-10 01:33:45,235 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 01:33:45,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:33:45,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:33:45,236 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:33:45,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:33:40" (3/4) ... [2018-11-10 01:33:45,239 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 01:33:45,280 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_94ad128f-3d45-41be-9f7e-d08f7e730d2d/bin-2019/uautomizer/witness.graphml [2018-11-10 01:33:45,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:33:45,280 INFO L168 Benchmark]: Toolchain (without parser) took 5181.27 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -89.2 MB). Peak memory consumption was 245.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:45,281 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:33:45,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.77 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:45,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.42 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:33:45,281 INFO L168 Benchmark]: Boogie Preprocessor took 67.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:45,282 INFO L168 Benchmark]: RCFGBuilder took 433.75 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: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:45,282 INFO L168 Benchmark]: BuchiAutomizer took 4372.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.5 MB). Peak memory consumption was 244.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:45,282 INFO L168 Benchmark]: Witness Printer took 44.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:33:45,283 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.77 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.42 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 433.75 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: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4372.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.5 MB). Peak memory consumption was 244.0 MB. Max. memory is 11.5 GB. * Witness Printer took 44.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 900 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.5s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 722 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 919 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1849 SDtfs, 1984 SDslu, 2536 SDs, 0 SdLazy, 214 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc2 concLT0 SILN1 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital72 mio100 ax100 hnf100 lsp15 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 4ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 22 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 269]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {count=0, \result=0, \result=0, P_1_pc=0, __retres1=0, C_1_i=1, tmp=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@428f64d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d524581=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@608e1c4=0, data_0=0, kernel_st=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___0=0, data_1=0, __retres1=1, max_loop=2, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@109f5f9b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@437d522e=0, C_1_pr=0, \result=0, i=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b9b2135=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22fedfeb=0, P_1_i=1, e=0, C_1_ev=0, tmp___1=0, __retres1=0, tmp___0=0, num=0, timer=0, P_1_ev=0, tmp=0, C_1_pc=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 269]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int C_1_pc ; [L123] int C_1_st ; [L124] int C_1_i ; [L125] int C_1_ev ; [L126] int C_1_pr ; [L490] int count ; [L491] int __retres2 ; [L495] num = 0 [L496] i = 0 [L497] max_loop = 2 [L499] timer = 0 [L500] P_1_pc = 0 [L501] C_1_pc = 0 [L503] count = 0 [L504] CALL init_model() [L483] P_1_i = 1 [L484] RET C_1_i = 1 [L504] init_model() [L505] CALL start_simulation() [L421] int kernel_st ; [L422] int tmp ; [L423] int tmp___0 ; [L427] kernel_st = 0 [L428] FCALL update_channels() [L429] CALL init_threads() [L226] COND TRUE (int )P_1_i == 1 [L227] P_1_st = 0 [L231] COND TRUE (int )C_1_i == 1 [L232] RET C_1_st = 0 [L429] init_threads() [L430] FCALL fire_delta_events() [L431] CALL activate_threads() [L365] int tmp ; [L366] int tmp___0 ; [L367] int tmp___1 ; [L371] CALL, EXPR is_P_1_triggered() [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] RET return (__retres1); [L371] EXPR is_P_1_triggered() [L371] tmp = is_P_1_triggered() [L373] COND FALSE !(\read(tmp)) [L379] CALL, EXPR is_C_1_triggered() [L186] int __retres1 ; [L189] COND FALSE !((int )C_1_pc == 1) [L199] COND FALSE !((int )C_1_pc == 2) [L209] __retres1 = 0 [L211] RET return (__retres1); [L379] EXPR is_C_1_triggered() [L379] tmp___1 = is_C_1_triggered() [L381] COND FALSE, RET !(\read(tmp___1)) [L431] activate_threads() [L432] FCALL reset_delta_events() [L435] COND TRUE 1 [L438] kernel_st = 1 [L439] CALL eval() [L262] int tmp ; [L263] int tmp___0 ; [L264] int tmp___1 ; [L265] int tmp___2 ; Loop: [L269] COND TRUE 1 [L272] CALL, EXPR exists_runnable_thread() [L241] int __retres1 ; [L244] COND TRUE (int )P_1_st == 0 [L245] __retres1 = 1 [L258] RET return (__retres1); [L272] EXPR exists_runnable_thread() [L272] tmp___2 = exists_runnable_thread() [L274] COND TRUE \read(tmp___2) [L279] COND TRUE (int )P_1_st == 0 [L281] tmp = __VERIFIER_nondet_int() [L283] COND FALSE !(\read(tmp)) [L294] COND TRUE (int )C_1_st == 0 [L296] tmp___1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...