./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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 fbecaa911234564619645b897eed5716f7c8acd9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-aa41828 [2018-11-23 13:26:46,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:26:46,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:26:46,636 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:26:46,636 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:26:46,637 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:26:46,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:26:46,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:26:46,640 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:26:46,640 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:26:46,641 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:26:46,641 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:26:46,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:26:46,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:26:46,643 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:26:46,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:26:46,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:26:46,645 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:26:46,646 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:26:46,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:26:46,648 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:26:46,649 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:26:46,650 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:26:46,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:26:46,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:26:46,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:26:46,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:26:46,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:26:46,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:26:46,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:26:46,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:26:46,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:26:46,654 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:26:46,654 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:26:46,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:26:46,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:26:46,655 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 13:26:46,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:26:46,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:26:46,666 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:26:46,666 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:26:46,666 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:26:46,667 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:26:46,667 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:26:46,667 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:26:46,667 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:26:46,667 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:26:46,667 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:26:46,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:26:46,667 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:26:46,668 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:26:46,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:26:46,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:26:46,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:26:46,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:26:46,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:26:46,668 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:26:46,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:26:46,669 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:26:46,669 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:26:46,669 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:26:46,669 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:26:46,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:26:46,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:26:46,669 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:26:46,670 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:26:46,670 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:26:46,670 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:26:46,671 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:26:46,671 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_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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 -> fbecaa911234564619645b897eed5716f7c8acd9 [2018-11-23 13:26:46,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:26:46,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:26:46,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:26:46,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:26:46,707 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:26:46,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.1_true-unreach-call_false-termination.cil.c [2018-11-23 13:26:46,753 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/data/61c2967ca/784530d44a2a4ad5975ee06a9ba6ee45/FLAG77504ab25 [2018-11-23 13:26:47,115 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:26:47,115 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/sv-benchmarks/c/systemc/mem_slave_tlm.1_true-unreach-call_false-termination.cil.c [2018-11-23 13:26:47,125 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/data/61c2967ca/784530d44a2a4ad5975ee06a9ba6ee45/FLAG77504ab25 [2018-11-23 13:26:47,512 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/data/61c2967ca/784530d44a2a4ad5975ee06a9ba6ee45 [2018-11-23 13:26:47,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:26:47,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:26:47,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:26:47,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:26:47,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:26:47,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3605d9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47, skipping insertion in model container [2018-11-23 13:26:47,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:26:47,559 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:26:47,731 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:26:47,734 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:26:47,789 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:26:47,801 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:26:47,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47 WrapperNode [2018-11-23 13:26:47,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:26:47,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:26:47,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:26:47,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:26:47,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:26:47,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:26:47,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:26:47,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:26:47,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... [2018-11-23 13:26:47,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:26:47,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:26:47,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:26:47,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:26:47,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:26:47,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:26:48,634 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:26:48,635 INFO L280 CfgBuilder]: Removed 39 assue(true) statements. [2018-11-23 13:26:48,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:26:48 BoogieIcfgContainer [2018-11-23 13:26:48,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:26:48,636 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:26:48,636 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:26:48,638 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:26:48,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:26:48,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:26:47" (1/3) ... [2018-11-23 13:26:48,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39872c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:26:48, skipping insertion in model container [2018-11-23 13:26:48,639 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:26:48,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:47" (2/3) ... [2018-11-23 13:26:48,640 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39872c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:26:48, skipping insertion in model container [2018-11-23 13:26:48,640 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:26:48,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:26:48" (3/3) ... [2018-11-23 13:26:48,642 INFO L375 chiAutomizerObserver]: Analyzing ICFG mem_slave_tlm.1_true-unreach-call_false-termination.cil.c [2018-11-23 13:26:48,674 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:26:48,675 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:26:48,675 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:26:48,675 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:26:48,675 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:26:48,675 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:26:48,675 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:26:48,675 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:26:48,675 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:26:48,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states. [2018-11-23 13:26:48,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 241 [2018-11-23 13:26:48,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:26:48,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:26:48,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:48,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:48,724 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:26:48,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states. [2018-11-23 13:26:48,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 241 [2018-11-23 13:26:48,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:26:48,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:26:48,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:48,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:48,737 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRYtrue ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 11#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 83#L1162true assume !(1 == ~m_run_i~0);~m_run_st~0 := 2; 210#L1162-2true assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 95#L1167-1true assume 1 == ~m_run_pc~0; 81#L1173true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 190#L1212true assume !(2 == ~s_run_pc~0); 101#L1233true assume !(1 == ~s_run_pc~0); 177#L1328-1true [2018-11-23 13:26:48,737 INFO L796 eck$LassoCheckResult]: Loop: 177#L1328-1true assume !false; 263#L1246true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 194#L1135true assume !true; 82#L1151true start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 71#L1253true assume 1 == ~m_run_pc~0; 23#L1254true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 126#L1293true assume 2 == ~s_run_pc~0; 67#L1308true assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 125#L1315true assume 0 == ~m_run_st~0; 177#L1328-1true [2018-11-23 13:26:48,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:48,741 INFO L82 PathProgramCache]: Analyzing trace with hash 180491512, now seen corresponding path program 1 times [2018-11-23 13:26:48,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:48,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:48,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:48,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:48,841 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-23 13:26:48,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:26:48,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:26:48,846 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:26:48,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash -196082677, now seen corresponding path program 1 times [2018-11-23 13:26:48,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:48,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:48,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:48,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:48,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:48,852 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-23 13:26:48,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:26:48,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:26:48,853 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:26:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:26:48,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:26:48,865 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 3 states. [2018-11-23 13:26:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:26:48,895 INFO L93 Difference]: Finished difference Result 265 states and 455 transitions. [2018-11-23 13:26:48,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:26:48,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 455 transitions. [2018-11-23 13:26:48,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 236 [2018-11-23 13:26:48,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 256 states and 446 transitions. [2018-11-23 13:26:48,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2018-11-23 13:26:48,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2018-11-23 13:26:48,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 446 transitions. [2018-11-23 13:26:48,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:26:48,910 INFO L705 BuchiCegarLoop]: Abstraction has 256 states and 446 transitions. [2018-11-23 13:26:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 446 transitions. [2018-11-23 13:26:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-11-23 13:26:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 13:26:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 446 transitions. [2018-11-23 13:26:48,941 INFO L728 BuchiCegarLoop]: Abstraction has 256 states and 446 transitions. [2018-11-23 13:26:48,941 INFO L608 BuchiCegarLoop]: Abstraction has 256 states and 446 transitions. [2018-11-23 13:26:48,941 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:26:48,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 446 transitions. [2018-11-23 13:26:48,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 236 [2018-11-23 13:26:48,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:26:48,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:26:48,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:48,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:48,944 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 562#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 563#L1162 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 693#L1162-2 assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 714#L1167-1 assume 1 == ~m_run_pc~0; 689#L1173 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 690#L1212 assume !(2 == ~s_run_pc~0); 719#L1233 assume !(1 == ~s_run_pc~0); 721#L1328-1 [2018-11-23 13:26:48,944 INFO L796 eck$LassoCheckResult]: Loop: 721#L1328-1 assume !false; 778#L1246 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 742#L1135 assume !false; 665#L1110 assume !(0 == ~m_run_st~0); 667#L1114 assume !(0 == ~s_run_st~0); 692#L1151 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 681#L1253 assume 1 == ~m_run_pc~0; 585#L1254 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 586#L1293 assume !(2 == ~s_run_pc~0); 626#L1314 assume !(1 == ~s_run_pc~0); 627#L1315 assume 0 == ~m_run_st~0; 721#L1328-1 [2018-11-23 13:26:48,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:48,944 INFO L82 PathProgramCache]: Analyzing trace with hash 123233210, now seen corresponding path program 1 times [2018-11-23 13:26:48,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:48,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:48,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:48,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:48,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:48,982 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-23 13:26:48,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:26:48,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:26:48,983 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:26:48,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:48,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1943511753, now seen corresponding path program 1 times [2018-11-23 13:26:48,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:48,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:48,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:48,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:48,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:49,046 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:26:49,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:26:49,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:26:49,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:26:49,047 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:26:49,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:26:49,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:26:49,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:26:49,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.1_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-23 13:26:49,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:26:49,048 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:26:49,060 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-23 13:26:49,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:49,066 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-23 13:26:49,069 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-23 13:26:49,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:49,072 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-23 13:26:49,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:49,074 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-23 13:26:49,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:49,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:49,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:26:49,154 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:49,164 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:26:49,164 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:49,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:26:49,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:26:49,203 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:26:49,204 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:26:49,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:26:49,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:26:49,204 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:26:49,204 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:26:49,204 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:26:49,204 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:26:49,204 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:26:49,204 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.1_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-23 13:26:49,204 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:26:49,205 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:26:49,205 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-23 13:26:49,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:49,213 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-23 13:26:49,216 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-23 13:26:49,218 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-23 13:26:49,221 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-23 13:26:49,223 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-23 13:26:49,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:49,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:49,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:49,307 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:26:49,311 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:26:49,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,313 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,315 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:49,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,327 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,327 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,329 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,330 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:49,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:49,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:49,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:49,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:49,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:49,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:49,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,355 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 13:26:49,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,357 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,357 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,366 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,366 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,369 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,369 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,372 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,372 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,375 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,375 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,379 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,380 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,384 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,385 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,387 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,387 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,393 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,393 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,395 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,396 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,397 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 13:26:49,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-23 13:26:49,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,398 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,398 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,399 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:49,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,407 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,408 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,410 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,410 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,411 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:49,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,413 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,413 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,414 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:49,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,416 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,416 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,420 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,421 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,425 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,426 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,428 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,429 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,433 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,434 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,436 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,436 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,437 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 13:26:49,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-23 13:26:49,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,438 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,439 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,440 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:49,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,449 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,450 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,452 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,452 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,453 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:49,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,455 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,455 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,456 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:49,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,458 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,459 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,463 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,463 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,468 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,469 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,471 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,471 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,475 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,476 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:49,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,478 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,479 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,480 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 13:26:49,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-23 13:26:49,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,481 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,481 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,495 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,496 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,496 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,499 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,499 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,499 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,502 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,503 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,503 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,510 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,510 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,510 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,511 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,516 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,516 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,517 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,523 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,524 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,526 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,526 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,527 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,528 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,533 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,533 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,533 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,534 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,538 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,538 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,539 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:49,539 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:49,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,540 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 13:26:49,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,541 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,542 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,542 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,543 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:49,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,557 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,557 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,558 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,558 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,561 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,562 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,562 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,563 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:49,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,565 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,565 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,566 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,567 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:49,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,575 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,575 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,576 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,577 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,582 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,582 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,583 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,583 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,590 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,590 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,591 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,593 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,594 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,595 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,600 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,600 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,601 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,604 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:49,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,604 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,605 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,606 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 13:26:49,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,607 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,607 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,608 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,608 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,610 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:49,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,625 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,625 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,626 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,627 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,629 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,629 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,630 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,631 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:49,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,661 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,661 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,661 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,664 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:49,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,674 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,674 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,675 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,681 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,682 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,683 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,691 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,691 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,692 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,694 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,694 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,695 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,701 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,701 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,702 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,704 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,704 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:49,705 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:49,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,706 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 13:26:49,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,706 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,707 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,708 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:49,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,714 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,714 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,721 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,721 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,721 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,721 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:49,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,724 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,724 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,724 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,725 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:49,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,728 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,729 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,729 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,733 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,733 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,734 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,734 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,738 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,739 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,739 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,741 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,742 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,742 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,745 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,745 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,746 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,748 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:49,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,748 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:49,748 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:49,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,750 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 13:26:49,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,751 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,751 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,753 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 13:26:49,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,771 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,771 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,775 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,775 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,775 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,776 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 13:26:49,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,779 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,779 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:49,779 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,780 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 13:26:49,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,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-23 13:26:49,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,785 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,785 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,790 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,790 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,798 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,799 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,802 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,803 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,807 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,808 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:49,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:49,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:49,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:49,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:49,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:49,812 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:49,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:49,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:49,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:26:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:26:49,816 INFO L87 Difference]: Start difference. First operand 256 states and 446 transitions. cyclomatic complexity: 191 Second operand 3 states. [2018-11-23 13:26:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:26:49,840 INFO L93 Difference]: Finished difference Result 256 states and 445 transitions. [2018-11-23 13:26:49,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:26:49,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 445 transitions. [2018-11-23 13:26:49,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 236 [2018-11-23 13:26:49,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 256 states and 445 transitions. [2018-11-23 13:26:49,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2018-11-23 13:26:49,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2018-11-23 13:26:49,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 445 transitions. [2018-11-23 13:26:49,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:26:49,852 INFO L705 BuchiCegarLoop]: Abstraction has 256 states and 445 transitions. [2018-11-23 13:26:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 445 transitions. [2018-11-23 13:26:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-11-23 13:26:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 13:26:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 445 transitions. [2018-11-23 13:26:49,861 INFO L728 BuchiCegarLoop]: Abstraction has 256 states and 445 transitions. [2018-11-23 13:26:49,861 INFO L608 BuchiCegarLoop]: Abstraction has 256 states and 445 transitions. [2018-11-23 13:26:49,861 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:26:49,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 445 transitions. [2018-11-23 13:26:49,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 236 [2018-11-23 13:26:49,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:26:49,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:26:49,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:49,865 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:49,866 INFO L794 eck$LassoCheckResult]: Stem: 1236#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 1080#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1081#L1162 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 1211#L1162-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 1232#L1167-1 assume 1 == ~m_run_pc~0; 1207#L1173 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1208#L1212 assume !(2 == ~s_run_pc~0); 1237#L1233 assume !(1 == ~s_run_pc~0); 1239#L1328-1 [2018-11-23 13:26:49,866 INFO L796 eck$LassoCheckResult]: Loop: 1239#L1328-1 assume !false; 1296#L1246 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1260#L1135 assume !false; 1183#L1110 assume !(0 == ~m_run_st~0); 1185#L1114 assume !(0 == ~s_run_st~0); 1210#L1151 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 1199#L1253 assume 1 == ~m_run_pc~0; 1103#L1254 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1104#L1293 assume !(2 == ~s_run_pc~0); 1144#L1314 assume !(1 == ~s_run_pc~0); 1145#L1315 assume 0 == ~m_run_st~0; 1239#L1328-1 [2018-11-23 13:26:49,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash 121386168, now seen corresponding path program 1 times [2018-11-23 13:26:49,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:49,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:49,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:49,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:49,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:26:49,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:26:49,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:26:49,889 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:26:49,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:49,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1943511753, now seen corresponding path program 2 times [2018-11-23 13:26:49,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:49,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:49,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:49,948 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:26:49,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:26:49,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:26:49,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:26:49,948 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:26:49,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:26:49,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:26:49,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:26:49,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.1_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 13:26:49,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:26:49,949 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:26:49,950 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-23 13:26:49,956 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-23 13:26:49,959 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-23 13:26:49,962 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-23 13:26:49,964 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-23 13:26:49,967 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-23 13:26:49,970 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-23 13:26:49,971 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-23 13:26:49,976 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-23 13:26:49,978 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-23 13:26:50,048 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:26:50,049 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:50,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:26:50,056 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:26:50,062 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:26:50,062 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_pc~0=7} Honda state: {~s_run_pc~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:50,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:26:50,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:26:50,095 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:26:50,095 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_st~0=7} Honda state: {~s_run_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:50,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:26:50,128 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:26:50,143 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:26:50,144 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:50,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:26:50,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:26:50,184 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:26:50,184 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:50,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:26:50,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:26:50,223 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:26:50,223 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~m_run_pc~0=1} Honda state: {~m_run_pc~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:50,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:26:50,240 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:26:50,242 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:26:50,242 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_m_ev~0=1} Honda state: {~c_m_ev~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:50,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:26:50,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:26:50,267 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:26:50,268 INFO L448 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_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:50,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:26:50,287 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/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-23 13:26:50,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:26:50,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:26:50,347 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:26:50,349 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:26:50,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:26:50,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:26:50,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:26:50,350 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:26:50,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:26:50,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:26:50,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:26:50,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.1_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 13:26:50,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:26:50,350 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:26:50,351 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-23 13:26:50,357 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-23 13:26:50,359 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-23 13:26:50,362 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-23 13:26:50,363 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-23 13:26:50,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:50,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:50,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:50,372 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-23 13:26:50,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:26:50,439 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:26:50,439 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:26:50,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,441 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,442 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,442 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:50,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:50,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:50,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:50,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:50,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,452 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:50,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:26:50,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:26:50,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,457 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 13:26:50,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,458 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,458 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,459 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,459 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,461 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,461 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,463 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,464 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,465 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,465 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,467 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,467 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,469 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,469 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,471 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,471 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,475 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,475 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,477 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,477 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,478 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 13:26:50,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,479 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,479 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,479 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:50,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,481 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,481 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,481 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:50,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,483 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,483 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,486 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,486 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,488 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,490 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,490 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,492 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,492 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,494 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,494 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,494 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:50,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,498 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,499 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,500 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 13:26:50,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-23 13:26:50,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,501 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,501 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,501 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:50,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,503 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,503 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,503 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:50,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,505 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,505 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,508 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,508 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,509 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,509 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,512 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,512 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,513 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,514 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,516 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,516 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,517 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:50,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,520 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,520 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:26:50,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,522 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,522 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,523 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 13:26:50,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-23 13:26:50,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,523 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,524 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,525 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,526 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,526 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,529 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,530 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,530 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,533 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,533 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,533 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,533 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,535 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,535 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,535 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,538 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,538 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,538 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,538 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,540 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,540 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,540 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,543 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,543 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,543 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,543 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,548 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,548 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,549 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,550 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,552 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,552 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,552 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 13:26:50,553 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 13:26:50,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,553 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 13:26:50,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,554 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,554 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,555 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,555 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,556 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:50,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,558 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,558 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,558 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,558 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,559 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:50,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,564 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,564 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,565 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,568 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,569 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,571 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,571 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,572 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,575 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,575 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,575 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,576 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,577 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,578 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,582 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,582 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,582 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,583 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:50,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,589 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,590 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,591 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 13:26:50,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,592 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,592 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,593 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 13:26:50,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,594 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,594 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,594 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,596 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:50,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,597 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,597 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,598 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,598 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,599 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:50,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,605 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,606 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,606 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,611 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,612 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,612 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,614 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,614 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,614 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,615 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,619 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,619 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,620 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,620 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,622 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,622 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,622 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,623 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,627 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,627 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,627 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,629 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 13:26:50,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,637 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,638 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,639 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,640 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,640 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,641 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 13:26:50,641 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 13:26:50,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,642 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 13:26:50,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,643 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,643 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,643 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,643 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,644 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:50,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,646 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,646 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,646 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,647 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:50,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,650 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,650 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,650 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,653 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,654 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,654 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,656 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,656 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,657 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,659 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,659 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,660 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,661 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,662 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,664 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,664 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,665 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,665 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,665 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:26:50,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,670 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,670 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,670 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,672 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 13:26:50,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,673 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 13:26:50,673 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:26:50,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,674 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 13:26:50,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,675 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,675 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,675 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,675 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,676 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 13:26:50,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,678 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,679 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,679 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,679 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 13:26:50,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,683 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,683 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,684 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,690 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,690 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,694 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,694 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,697 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,698 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,701 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,701 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,705 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,705 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:26:50,705 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,706 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 13:26:50,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:26:50,715 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,715 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,773 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,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-23 13:26:50,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 13:26:50,777 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 13:26:50,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:26:50,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:26:50,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:26:50,777 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 13:26:50,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:26:50,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:26:50,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:26:50,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:26:50,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:26:50,781 INFO L87 Difference]: Start difference. First operand 256 states and 445 transitions. cyclomatic complexity: 190 Second operand 3 states. [2018-11-23 13:26:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:26:51,187 INFO L93 Difference]: Finished difference Result 426 states and 662 transitions. [2018-11-23 13:26:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:26:51,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 662 transitions. [2018-11-23 13:26:51,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 412 [2018-11-23 13:26:51,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 426 states and 662 transitions. [2018-11-23 13:26:51,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 426 [2018-11-23 13:26:51,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 426 [2018-11-23 13:26:51,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 426 states and 662 transitions. [2018-11-23 13:26:51,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:26:51,195 INFO L705 BuchiCegarLoop]: Abstraction has 426 states and 662 transitions. [2018-11-23 13:26:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states and 662 transitions. [2018-11-23 13:26:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 420. [2018-11-23 13:26:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-11-23 13:26:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 656 transitions. [2018-11-23 13:26:51,211 INFO L728 BuchiCegarLoop]: Abstraction has 420 states and 656 transitions. [2018-11-23 13:26:51,211 INFO L608 BuchiCegarLoop]: Abstraction has 420 states and 656 transitions. [2018-11-23 13:26:51,211 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:26:51,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 420 states and 656 transitions. [2018-11-23 13:26:51,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 406 [2018-11-23 13:26:51,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:26:51,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:26:51,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:51,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:51,214 INFO L794 eck$LassoCheckResult]: Stem: 1932#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 1766#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1767#L1162 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 1901#L1162-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 1926#L1167-1 assume !(1 == ~m_run_pc~0); 1927#L1179 assume !(2 == ~m_run_pc~0); 1861#L1187 assume !(3 == ~m_run_pc~0); 1862#L1195 assume !(4 == ~m_run_pc~0); 1896#L1203 assume !(5 == ~m_run_pc~0); 1938#L1211 assume !(6 == ~m_run_pc~0); 1939#L1212 assume !(2 == ~s_run_pc~0); 1934#L1233 assume !(1 == ~s_run_pc~0); 1936#L1328-1 [2018-11-23 13:26:51,214 INFO L796 eck$LassoCheckResult]: Loop: 1936#L1328-1 assume !false; 2148#L1246 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1956#L1135 assume !false; 2143#L1110 assume !(0 == ~m_run_st~0); 2144#L1114 assume !(0 == ~s_run_st~0); 2145#L1151 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 1887#L1253 assume !(1 == ~m_run_pc~0); 1888#L1260 assume !(2 == ~m_run_pc~0); 1967#L1268 assume !(3 == ~m_run_pc~0); 1781#L1276 assume !(4 == ~m_run_pc~0); 1782#L1284 assume !(5 == ~m_run_pc~0); 1829#L1292 assume !(6 == ~m_run_pc~0); 1830#L1293 assume 2 == ~s_run_pc~0; 2153#L1308 assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 2150#L1315 assume 0 == ~m_run_st~0; 1936#L1328-1 [2018-11-23 13:26:51,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:51,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1577837401, now seen corresponding path program 1 times [2018-11-23 13:26:51,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:51,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:51,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:26:51,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1525873377, now seen corresponding path program 1 times [2018-11-23 13:26:51,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:51,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:51,236 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-23 13:26:51,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:26:51,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:26:51,236 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:26:51,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:26:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:26:51,237 INFO L87 Difference]: Start difference. First operand 420 states and 656 transitions. cyclomatic complexity: 237 Second operand 3 states. [2018-11-23 13:26:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:26:51,355 INFO L93 Difference]: Finished difference Result 676 states and 1077 transitions. [2018-11-23 13:26:51,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:26:51,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 676 states and 1077 transitions. [2018-11-23 13:26:51,360 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 653 [2018-11-23 13:26:51,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 676 states to 676 states and 1077 transitions. [2018-11-23 13:26:51,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 676 [2018-11-23 13:26:51,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 676 [2018-11-23 13:26:51,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 676 states and 1077 transitions. [2018-11-23 13:26:51,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:26:51,366 INFO L705 BuchiCegarLoop]: Abstraction has 676 states and 1077 transitions. [2018-11-23 13:26:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states and 1077 transitions. [2018-11-23 13:26:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 670. [2018-11-23 13:26:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-11-23 13:26:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1071 transitions. [2018-11-23 13:26:51,379 INFO L728 BuchiCegarLoop]: Abstraction has 670 states and 1071 transitions. [2018-11-23 13:26:51,380 INFO L608 BuchiCegarLoop]: Abstraction has 670 states and 1071 transitions. [2018-11-23 13:26:51,380 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:26:51,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 670 states and 1071 transitions. [2018-11-23 13:26:51,383 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 647 [2018-11-23 13:26:51,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:26:51,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:26:51,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:51,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:26:51,384 INFO L794 eck$LassoCheckResult]: Stem: 3032#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 2869#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 2870#L1162 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 3003#L1162-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 3028#L1167-1 assume !(1 == ~m_run_pc~0); 3029#L1179 assume !(2 == ~m_run_pc~0); 2965#L1187 assume !(3 == ~m_run_pc~0); 2966#L1195 assume !(4 == ~m_run_pc~0); 2999#L1203 assume !(5 == ~m_run_pc~0); 3038#L1211 assume !(6 == ~m_run_pc~0); 3039#L1212 assume !(2 == ~s_run_pc~0); 3034#L1233 assume !(1 == ~s_run_pc~0); 3036#L1328-1 assume !false; 3113#L1246 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 3475#L1135 [2018-11-23 13:26:51,384 INFO L796 eck$LassoCheckResult]: Loop: 3475#L1135 assume !false; 3474#L1110 assume 0 == ~m_run_st~0; 3473#L1114-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 3116#L1124 assume !(0 != eval_~tmp~0); 3117#L1120 assume !(0 == ~s_run_st~0); 3475#L1135 [2018-11-23 13:26:51,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 1 times [2018-11-23 13:26:51,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:51,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash 151895559, now seen corresponding path program 1 times [2018-11-23 13:26:51,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:51,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash -840624531, now seen corresponding path program 1 times [2018-11-23 13:26:51,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:51,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:51,413 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-23 13:26:51,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:26:51,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:26:51,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:26:51,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:26:51,445 INFO L87 Difference]: Start difference. First operand 670 states and 1071 transitions. cyclomatic complexity: 404 Second operand 3 states. [2018-11-23 13:26:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:26:51,499 INFO L93 Difference]: Finished difference Result 1262 states and 2014 transitions. [2018-11-23 13:26:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:26:51,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1262 states and 2014 transitions. [2018-11-23 13:26:51,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1231 [2018-11-23 13:26:51,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1262 states to 1262 states and 2014 transitions. [2018-11-23 13:26:51,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1262 [2018-11-23 13:26:51,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1262 [2018-11-23 13:26:51,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1262 states and 2014 transitions. [2018-11-23 13:26:51,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:26:51,512 INFO L705 BuchiCegarLoop]: Abstraction has 1262 states and 2014 transitions. [2018-11-23 13:26:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states and 2014 transitions. [2018-11-23 13:26:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1082. [2018-11-23 13:26:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2018-11-23 13:26:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1738 transitions. [2018-11-23 13:26:51,523 INFO L728 BuchiCegarLoop]: Abstraction has 1082 states and 1738 transitions. [2018-11-23 13:26:51,523 INFO L608 BuchiCegarLoop]: Abstraction has 1082 states and 1738 transitions. [2018-11-23 13:26:51,524 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:26:51,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1082 states and 1738 transitions. [2018-11-23 13:26:51,527 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1051 [2018-11-23 13:26:51,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:26:51,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:26:51,528 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:26:51,528 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:26:51,528 INFO L794 eck$LassoCheckResult]: Stem: 4975#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 4808#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4809#L1162 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 4947#L1162-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 4969#L1167-1 assume !(1 == ~m_run_pc~0); 4970#L1179 assume !(2 == ~m_run_pc~0); 4910#L1187 assume !(3 == ~m_run_pc~0); 4911#L1195 assume !(4 == ~m_run_pc~0); 4942#L1203 assume !(5 == ~m_run_pc~0); 4980#L1211 assume !(6 == ~m_run_pc~0); 4981#L1212 assume !(2 == ~s_run_pc~0); 4976#L1233 assume !(1 == ~s_run_pc~0); 4978#L1328-1 assume !false; 5778#L1246 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 5757#L1135 [2018-11-23 13:26:51,528 INFO L796 eck$LassoCheckResult]: Loop: 5757#L1135 assume !false; 5775#L1110 assume 0 == ~m_run_st~0; 5156#L1114-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 5131#L1124 assume !(0 != eval_~tmp~0); 5132#L1120 assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 5624#L1139 assume !(0 != eval_~tmp___0~0); 5757#L1135 [2018-11-23 13:26:51,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:51,528 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 2 times [2018-11-23 13:26:51,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:51,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:51,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:51,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash 413786745, now seen corresponding path program 1 times [2018-11-23 13:26:51,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:51,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:51,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:26:51,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:51,542 INFO L82 PathProgramCache]: Analyzing trace with hash -289564973, now seen corresponding path program 1 times [2018-11-23 13:26:51,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:26:51,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:26:51,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:26:51,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:26:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:51,878 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; [?] havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~m_run_i~0;~m_run_st~0 := 0; [?] assume 1 == ~s_run_i~0;~s_run_st~0 := 0; [?] assume !(1 == ~m_run_pc~0); [?] assume !(2 == ~m_run_pc~0); [?] assume !(3 == ~m_run_pc~0); [?] assume !(4 == ~m_run_pc~0); [?] assume !(5 == ~m_run_pc~0); [?] assume !(6 == ~m_run_pc~0); [?] assume !(2 == ~s_run_pc~0); [?] assume !(1 == ~s_run_pc~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162-L1166] assume 1 == ~m_run_i~0; [L1163] ~m_run_st~0 := 0; [L1167-L1171] assume 1 == ~s_run_i~0; [L1168] ~s_run_st~0 := 0; [L1172-L1225] assume !(1 == ~m_run_pc~0); [L1180-L1224] assume !(2 == ~m_run_pc~0); [L1188-L1223] assume !(3 == ~m_run_pc~0); [L1196-L1222] assume !(4 == ~m_run_pc~0); [L1204-L1221] assume !(5 == ~m_run_pc~0); [L1212-L1220] assume !(6 == ~m_run_pc~0); [L1226-L1243] assume !(2 == ~s_run_pc~0); [L1234-L1242] assume !(1 == ~s_run_pc~0); [L1245-L1334] assume !false; [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162-L1166] assume 1 == ~m_run_i~0; [L1163] ~m_run_st~0 := 0; [L1167-L1171] assume 1 == ~s_run_i~0; [L1168] ~s_run_st~0 := 0; [L1172-L1225] assume !(1 == ~m_run_pc~0); [L1180-L1224] assume !(2 == ~m_run_pc~0); [L1188-L1223] assume !(3 == ~m_run_pc~0); [L1196-L1222] assume !(4 == ~m_run_pc~0); [L1204-L1221] assume !(5 == ~m_run_pc~0); [L1212-L1220] assume !(6 == ~m_run_pc~0); [L1226-L1243] assume !(2 == ~s_run_pc~0); [L1234-L1242] assume !(1 == ~s_run_pc~0); [L1245-L1334] assume !false; [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [L1342] havoc ~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1158] havoc ~kernel_st~0; [L1161] ~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] ~kernel_st~0 := 1; [L1104] havoc ~tmp~0; [L1105] havoc ~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [L1342] havoc ~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1158] havoc ~kernel_st~0; [L1161] ~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] ~kernel_st~0 := 1; [L1104] havoc ~tmp~0; [L1105] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L20] int s_run_st ; [L21] int s_run_i ; [L22] int s_run_pc ; [L23] int c_m_lock ; [L24] int c_m_ev ; [L25] int c_req_type ; [L26] int c_req_a ; [L27] int c_req_d ; [L28] int c_rsp_type ; [L29] int c_rsp_status ; [L30] int c_rsp_d ; [L31] int c_empty_req ; [L32] int c_empty_rsp ; [L33] int c_read_req_ev ; [L34] int c_write_req_ev ; [L35] int c_read_rsp_ev ; [L36] int c_write_rsp_ev ; [L37] static int d_t ; [L38] static int a_t ; [L39] static int req_t_type ; [L40] static int req_t_a ; [L41] static int req_t_d ; [L42] static int rsp_t_type ; [L43] static int rsp_t_status ; [L44] static int rsp_t_d ; [L45] static int req_tt_type ; [L46] static int req_tt_a ; [L47] static int req_tt_d ; [L48] static int rsp_tt_type ; [L49] static int rsp_tt_status ; [L50] static int rsp_tt_d ; [L835] static int req_t_type___0 ; [L836] static int req_t_a___0 ; [L837] static int req_t_d___0 ; [L838] static int rsp_t_type___0 ; [L839] static int rsp_t_status___0 ; [L840] static int rsp_t_d___0 ; [L1342] int __retres1 ; [L1346] c_m_lock = 0 [L1347] c_m_ev = 2 [L1349] m_run_i = 1 [L1350] m_run_pc = 0 [L1351] s_run_i = 1 [L1352] s_run_pc = 0 [L1353] c_empty_req = 1 [L1354] c_empty_rsp = 1 [L1355] c_read_req_ev = 2 [L1356] c_write_req_ev = 2 [L1357] c_read_rsp_ev = 2 [L1358] c_write_rsp_ev = 2 [L1359] c_m_lock = 0 [L1360] c_m_ev = 2 [L1158] int kernel_st ; [L1161] kernel_st = 0 [L1162] COND TRUE (int )m_run_i == 1 [L1163] m_run_st = 0 [L1167] COND TRUE (int )s_run_i == 1 [L1168] s_run_st = 0 [L1172] COND FALSE !((int )m_run_pc == 1) [L1180] COND FALSE !((int )m_run_pc == 2) [L1188] COND FALSE !((int )m_run_pc == 3) [L1196] COND FALSE !((int )m_run_pc == 4) [L1204] COND FALSE !((int )m_run_pc == 5) [L1212] COND FALSE !((int )m_run_pc == 6) [L1226] COND FALSE !((int )s_run_pc == 2) [L1234] COND FALSE !((int )s_run_pc == 1) [L1245] COND TRUE 1 [L1248] kernel_st = 1 [L1104] int tmp ; [L1105] int tmp___0 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~m_run_st~0; [?] assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___0~0); [L1109-L1150] assume !false; [L1111-L1119] assume 0 == ~m_run_st~0; [L1120-L1134] assume 0 == ~m_run_st~0; [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] assume !(0 != eval_~tmp~0); [L1135-L1149] assume 0 == ~s_run_st~0; [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1109-L1150] assume !false; [L1111-L1119] assume 0 == ~m_run_st~0; [L1120-L1134] assume 0 == ~m_run_st~0; [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] assume !(0 != eval_~tmp~0); [L1135-L1149] assume 0 == ~s_run_st~0; [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] assume !(0 != eval_~tmp___0~0); [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] COND FALSE !(0 != eval_~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] COND FALSE !(0 != eval_~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] COND FALSE !(0 != eval_~tmp___0~0) [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] ~tmp~0 := #t~nondet1; [L1122] havoc #t~nondet1; [L1124-L1131] COND FALSE !(0 != ~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] ~tmp___0~0 := #t~nondet2; [L1137] havoc #t~nondet2; [L1139-L1146] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] ~tmp~0 := #t~nondet1; [L1122] havoc #t~nondet1; [L1124-L1131] COND FALSE !(0 != ~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] ~tmp___0~0 := #t~nondet2; [L1137] havoc #t~nondet2; [L1139-L1146] COND FALSE !(0 != ~tmp___0~0) [L1109] COND TRUE 1 [L1111] COND TRUE (int )m_run_st == 0 [L1120] COND TRUE (int )m_run_st == 0 [L1122] tmp = __VERIFIER_nondet_int() [L1124] COND FALSE !(\read(tmp)) [L1135] COND TRUE (int )s_run_st == 0 [L1137] tmp___0 = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp___0)) ----- [2018-11-23 13:26:51,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:26:51 BoogieIcfgContainer [2018-11-23 13:26:51,976 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:26:51,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:26:51,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:26:51,976 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:26:51,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:26:48" (3/4) ... [2018-11-23 13:26:51,980 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; [?] havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~m_run_i~0;~m_run_st~0 := 0; [?] assume 1 == ~s_run_i~0;~s_run_st~0 := 0; [?] assume !(1 == ~m_run_pc~0); [?] assume !(2 == ~m_run_pc~0); [?] assume !(3 == ~m_run_pc~0); [?] assume !(4 == ~m_run_pc~0); [?] assume !(5 == ~m_run_pc~0); [?] assume !(6 == ~m_run_pc~0); [?] assume !(2 == ~s_run_pc~0); [?] assume !(1 == ~s_run_pc~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162-L1166] assume 1 == ~m_run_i~0; [L1163] ~m_run_st~0 := 0; [L1167-L1171] assume 1 == ~s_run_i~0; [L1168] ~s_run_st~0 := 0; [L1172-L1225] assume !(1 == ~m_run_pc~0); [L1180-L1224] assume !(2 == ~m_run_pc~0); [L1188-L1223] assume !(3 == ~m_run_pc~0); [L1196-L1222] assume !(4 == ~m_run_pc~0); [L1204-L1221] assume !(5 == ~m_run_pc~0); [L1212-L1220] assume !(6 == ~m_run_pc~0); [L1226-L1243] assume !(2 == ~s_run_pc~0); [L1234-L1242] assume !(1 == ~s_run_pc~0); [L1245-L1334] assume !false; [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162-L1166] assume 1 == ~m_run_i~0; [L1163] ~m_run_st~0 := 0; [L1167-L1171] assume 1 == ~s_run_i~0; [L1168] ~s_run_st~0 := 0; [L1172-L1225] assume !(1 == ~m_run_pc~0); [L1180-L1224] assume !(2 == ~m_run_pc~0); [L1188-L1223] assume !(3 == ~m_run_pc~0); [L1196-L1222] assume !(4 == ~m_run_pc~0); [L1204-L1221] assume !(5 == ~m_run_pc~0); [L1212-L1220] assume !(6 == ~m_run_pc~0); [L1226-L1243] assume !(2 == ~s_run_pc~0); [L1234-L1242] assume !(1 == ~s_run_pc~0); [L1245-L1334] assume !false; [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [L1342] havoc ~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1158] havoc ~kernel_st~0; [L1161] ~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] ~kernel_st~0 := 1; [L1104] havoc ~tmp~0; [L1105] havoc ~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [L1342] havoc ~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1158] havoc ~kernel_st~0; [L1161] ~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] ~kernel_st~0 := 1; [L1104] havoc ~tmp~0; [L1105] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L20] int s_run_st ; [L21] int s_run_i ; [L22] int s_run_pc ; [L23] int c_m_lock ; [L24] int c_m_ev ; [L25] int c_req_type ; [L26] int c_req_a ; [L27] int c_req_d ; [L28] int c_rsp_type ; [L29] int c_rsp_status ; [L30] int c_rsp_d ; [L31] int c_empty_req ; [L32] int c_empty_rsp ; [L33] int c_read_req_ev ; [L34] int c_write_req_ev ; [L35] int c_read_rsp_ev ; [L36] int c_write_rsp_ev ; [L37] static int d_t ; [L38] static int a_t ; [L39] static int req_t_type ; [L40] static int req_t_a ; [L41] static int req_t_d ; [L42] static int rsp_t_type ; [L43] static int rsp_t_status ; [L44] static int rsp_t_d ; [L45] static int req_tt_type ; [L46] static int req_tt_a ; [L47] static int req_tt_d ; [L48] static int rsp_tt_type ; [L49] static int rsp_tt_status ; [L50] static int rsp_tt_d ; [L835] static int req_t_type___0 ; [L836] static int req_t_a___0 ; [L837] static int req_t_d___0 ; [L838] static int rsp_t_type___0 ; [L839] static int rsp_t_status___0 ; [L840] static int rsp_t_d___0 ; [L1342] int __retres1 ; [L1346] c_m_lock = 0 [L1347] c_m_ev = 2 [L1349] m_run_i = 1 [L1350] m_run_pc = 0 [L1351] s_run_i = 1 [L1352] s_run_pc = 0 [L1353] c_empty_req = 1 [L1354] c_empty_rsp = 1 [L1355] c_read_req_ev = 2 [L1356] c_write_req_ev = 2 [L1357] c_read_rsp_ev = 2 [L1358] c_write_rsp_ev = 2 [L1359] c_m_lock = 0 [L1360] c_m_ev = 2 [L1158] int kernel_st ; [L1161] kernel_st = 0 [L1162] COND TRUE (int )m_run_i == 1 [L1163] m_run_st = 0 [L1167] COND TRUE (int )s_run_i == 1 [L1168] s_run_st = 0 [L1172] COND FALSE !((int )m_run_pc == 1) [L1180] COND FALSE !((int )m_run_pc == 2) [L1188] COND FALSE !((int )m_run_pc == 3) [L1196] COND FALSE !((int )m_run_pc == 4) [L1204] COND FALSE !((int )m_run_pc == 5) [L1212] COND FALSE !((int )m_run_pc == 6) [L1226] COND FALSE !((int )s_run_pc == 2) [L1234] COND FALSE !((int )s_run_pc == 1) [L1245] COND TRUE 1 [L1248] kernel_st = 1 [L1104] int tmp ; [L1105] int tmp___0 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~m_run_st~0; [?] assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___0~0); [L1109-L1150] assume !false; [L1111-L1119] assume 0 == ~m_run_st~0; [L1120-L1134] assume 0 == ~m_run_st~0; [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] assume !(0 != eval_~tmp~0); [L1135-L1149] assume 0 == ~s_run_st~0; [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1109-L1150] assume !false; [L1111-L1119] assume 0 == ~m_run_st~0; [L1120-L1134] assume 0 == ~m_run_st~0; [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] assume !(0 != eval_~tmp~0); [L1135-L1149] assume 0 == ~s_run_st~0; [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] assume !(0 != eval_~tmp___0~0); [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] COND FALSE !(0 != eval_~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] COND FALSE !(0 != eval_~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] COND FALSE !(0 != eval_~tmp___0~0) [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] ~tmp~0 := #t~nondet1; [L1122] havoc #t~nondet1; [L1124-L1131] COND FALSE !(0 != ~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] ~tmp___0~0 := #t~nondet2; [L1137] havoc #t~nondet2; [L1139-L1146] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] ~tmp~0 := #t~nondet1; [L1122] havoc #t~nondet1; [L1124-L1131] COND FALSE !(0 != ~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] ~tmp___0~0 := #t~nondet2; [L1137] havoc #t~nondet2; [L1139-L1146] COND FALSE !(0 != ~tmp___0~0) [L1109] COND TRUE 1 [L1111] COND TRUE (int )m_run_st == 0 [L1120] COND TRUE (int )m_run_st == 0 [L1122] tmp = __VERIFIER_nondet_int() [L1124] COND FALSE !(\read(tmp)) [L1135] COND TRUE (int )s_run_st == 0 [L1137] tmp___0 = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp___0)) ----- [2018-11-23 13:26:52,085 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_63c7e0e7-08a5-4b4c-b064-e3ab08b16f48/bin-2019/uautomizer/witness.graphml [2018-11-23 13:26:52,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:26:52,086 INFO L168 Benchmark]: Toolchain (without parser) took 4570.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 955.5 MB in the beginning and 927.2 MB in the end (delta: 28.3 MB). Peak memory consumption was 238.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:52,086 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:26:52,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.56 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 931.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:52,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 931.3 MB in the beginning and 1.1 GB in the end (delta: -200.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:52,087 INFO L168 Benchmark]: Boogie Preprocessor took 33.45 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:52,088 INFO L168 Benchmark]: RCFGBuilder took 717.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:52,088 INFO L168 Benchmark]: BuchiAutomizer took 3340.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.0 GB in the beginning and 927.2 MB in the end (delta: 121.9 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:52,088 INFO L168 Benchmark]: Witness Printer took 108.68 ms. Allocated memory is still 1.2 GB. Free memory is still 927.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:26:52,090 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.56 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 931.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 931.3 MB in the beginning and 1.1 GB in the end (delta: -200.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.45 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 717.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3340.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.0 GB in the beginning and 927.2 MB in the end (delta: 121.9 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. * Witness Printer took 108.68 ms. Allocated memory is still 1.2 GB. Free memory is still 927.2 MB. 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 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.4s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 192 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1082 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2403 SDtfs, 1816 SDslu, 978 SDs, 0 SdLazy, 285 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax100 hnf100 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf100 smp100 dnf211 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 19ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 1109]: 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 {req_tt_d=0, rsp_t_d___0=0, a_t=0, c_rsp_d=0, c_m_lock=0, \result=0, m_run_st=0, req_tt_a=0, c_write_req_ev=2, s_run_i=1, s_run_st=0, rsp_t_status=0, tmp=0, kernel_st=1, rsp_tt_status=0, c_empty_req=1, req_t_type___0=0, tmp___0=0, c_read_rsp_ev=2, m_run_i=1, rsp_t_status___0=0, c_m_ev=2, c_empty_rsp=1, req_t_d___0=0, req_t_d=0, c_req_d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2be35b82=0, c_read_req_ev=2, req_t_a=0, c_req_a=0, rsp_t_type=0, req_t_a___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a1b2f4c=0, c_req_type=0, s_memory0=0, req_t_type=0, d_t=0, req_tt_type=0, rsp_t_d=0, c_write_rsp_ev=2, rsp_t_type___0=0, c_rsp_status=0, m_run_pc=0, s_run_pc=0, rsp_tt_type=0, rsp_tt_d=0, c_rsp_type=0, __retres1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1109]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; [?] havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~m_run_i~0;~m_run_st~0 := 0; [?] assume 1 == ~s_run_i~0;~s_run_st~0 := 0; [?] assume !(1 == ~m_run_pc~0); [?] assume !(2 == ~m_run_pc~0); [?] assume !(3 == ~m_run_pc~0); [?] assume !(4 == ~m_run_pc~0); [?] assume !(5 == ~m_run_pc~0); [?] assume !(6 == ~m_run_pc~0); [?] assume !(2 == ~s_run_pc~0); [?] assume !(1 == ~s_run_pc~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162-L1166] assume 1 == ~m_run_i~0; [L1163] ~m_run_st~0 := 0; [L1167-L1171] assume 1 == ~s_run_i~0; [L1168] ~s_run_st~0 := 0; [L1172-L1225] assume !(1 == ~m_run_pc~0); [L1180-L1224] assume !(2 == ~m_run_pc~0); [L1188-L1223] assume !(3 == ~m_run_pc~0); [L1196-L1222] assume !(4 == ~m_run_pc~0); [L1204-L1221] assume !(5 == ~m_run_pc~0); [L1212-L1220] assume !(6 == ~m_run_pc~0); [L1226-L1243] assume !(2 == ~s_run_pc~0); [L1234-L1242] assume !(1 == ~s_run_pc~0); [L1245-L1334] assume !false; [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162-L1166] assume 1 == ~m_run_i~0; [L1163] ~m_run_st~0 := 0; [L1167-L1171] assume 1 == ~s_run_i~0; [L1168] ~s_run_st~0 := 0; [L1172-L1225] assume !(1 == ~m_run_pc~0); [L1180-L1224] assume !(2 == ~m_run_pc~0); [L1188-L1223] assume !(3 == ~m_run_pc~0); [L1196-L1222] assume !(4 == ~m_run_pc~0); [L1204-L1221] assume !(5 == ~m_run_pc~0); [L1212-L1220] assume !(6 == ~m_run_pc~0); [L1226-L1243] assume !(2 == ~s_run_pc~0); [L1234-L1242] assume !(1 == ~s_run_pc~0); [L1245-L1334] assume !false; [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [L1342] havoc ~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1158] havoc ~kernel_st~0; [L1161] ~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] ~kernel_st~0 := 1; [L1104] havoc ~tmp~0; [L1105] havoc ~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [L1342] havoc ~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1158] havoc ~kernel_st~0; [L1161] ~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] ~kernel_st~0 := 1; [L1104] havoc ~tmp~0; [L1105] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L20] int s_run_st ; [L21] int s_run_i ; [L22] int s_run_pc ; [L23] int c_m_lock ; [L24] int c_m_ev ; [L25] int c_req_type ; [L26] int c_req_a ; [L27] int c_req_d ; [L28] int c_rsp_type ; [L29] int c_rsp_status ; [L30] int c_rsp_d ; [L31] int c_empty_req ; [L32] int c_empty_rsp ; [L33] int c_read_req_ev ; [L34] int c_write_req_ev ; [L35] int c_read_rsp_ev ; [L36] int c_write_rsp_ev ; [L37] static int d_t ; [L38] static int a_t ; [L39] static int req_t_type ; [L40] static int req_t_a ; [L41] static int req_t_d ; [L42] static int rsp_t_type ; [L43] static int rsp_t_status ; [L44] static int rsp_t_d ; [L45] static int req_tt_type ; [L46] static int req_tt_a ; [L47] static int req_tt_d ; [L48] static int rsp_tt_type ; [L49] static int rsp_tt_status ; [L50] static int rsp_tt_d ; [L835] static int req_t_type___0 ; [L836] static int req_t_a___0 ; [L837] static int req_t_d___0 ; [L838] static int rsp_t_type___0 ; [L839] static int rsp_t_status___0 ; [L840] static int rsp_t_d___0 ; [L1342] int __retres1 ; [L1346] c_m_lock = 0 [L1347] c_m_ev = 2 [L1349] m_run_i = 1 [L1350] m_run_pc = 0 [L1351] s_run_i = 1 [L1352] s_run_pc = 0 [L1353] c_empty_req = 1 [L1354] c_empty_rsp = 1 [L1355] c_read_req_ev = 2 [L1356] c_write_req_ev = 2 [L1357] c_read_rsp_ev = 2 [L1358] c_write_rsp_ev = 2 [L1359] c_m_lock = 0 [L1360] c_m_ev = 2 [L1158] int kernel_st ; [L1161] kernel_st = 0 [L1162] COND TRUE (int )m_run_i == 1 [L1163] m_run_st = 0 [L1167] COND TRUE (int )s_run_i == 1 [L1168] s_run_st = 0 [L1172] COND FALSE !((int )m_run_pc == 1) [L1180] COND FALSE !((int )m_run_pc == 2) [L1188] COND FALSE !((int )m_run_pc == 3) [L1196] COND FALSE !((int )m_run_pc == 4) [L1204] COND FALSE !((int )m_run_pc == 5) [L1212] COND FALSE !((int )m_run_pc == 6) [L1226] COND FALSE !((int )s_run_pc == 2) [L1234] COND FALSE !((int )s_run_pc == 1) [L1245] COND TRUE 1 [L1248] kernel_st = 1 [L1104] int tmp ; [L1105] int tmp___0 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~m_run_st~0; [?] assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___0~0); [L1109-L1150] assume !false; [L1111-L1119] assume 0 == ~m_run_st~0; [L1120-L1134] assume 0 == ~m_run_st~0; [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] assume !(0 != eval_~tmp~0); [L1135-L1149] assume 0 == ~s_run_st~0; [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1109-L1150] assume !false; [L1111-L1119] assume 0 == ~m_run_st~0; [L1120-L1134] assume 0 == ~m_run_st~0; [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] assume !(0 != eval_~tmp~0); [L1135-L1149] assume 0 == ~s_run_st~0; [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] assume !(0 != eval_~tmp___0~0); [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] COND FALSE !(0 != eval_~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] COND FALSE !(0 != eval_~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] COND FALSE !(0 != eval_~tmp___0~0) [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] ~tmp~0 := #t~nondet1; [L1122] havoc #t~nondet1; [L1124-L1131] COND FALSE !(0 != ~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] ~tmp___0~0 := #t~nondet2; [L1137] havoc #t~nondet2; [L1139-L1146] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] ~tmp~0 := #t~nondet1; [L1122] havoc #t~nondet1; [L1124-L1131] COND FALSE !(0 != ~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] ~tmp___0~0 := #t~nondet2; [L1137] havoc #t~nondet2; [L1139-L1146] COND FALSE !(0 != ~tmp___0~0) [L1109] COND TRUE 1 [L1111] COND TRUE (int )m_run_st == 0 [L1120] COND TRUE (int )m_run_st == 0 [L1122] tmp = __VERIFIER_nondet_int() [L1124] COND FALSE !(\read(tmp)) [L1135] COND TRUE (int )s_run_st == 0 [L1137] tmp___0 = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp___0)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; [?] havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~m_run_i~0;~m_run_st~0 := 0; [?] assume 1 == ~s_run_i~0;~s_run_st~0 := 0; [?] assume !(1 == ~m_run_pc~0); [?] assume !(2 == ~m_run_pc~0); [?] assume !(3 == ~m_run_pc~0); [?] assume !(4 == ~m_run_pc~0); [?] assume !(5 == ~m_run_pc~0); [?] assume !(6 == ~m_run_pc~0); [?] assume !(2 == ~s_run_pc~0); [?] assume !(1 == ~s_run_pc~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162-L1166] assume 1 == ~m_run_i~0; [L1163] ~m_run_st~0 := 0; [L1167-L1171] assume 1 == ~s_run_i~0; [L1168] ~s_run_st~0 := 0; [L1172-L1225] assume !(1 == ~m_run_pc~0); [L1180-L1224] assume !(2 == ~m_run_pc~0); [L1188-L1223] assume !(3 == ~m_run_pc~0); [L1196-L1222] assume !(4 == ~m_run_pc~0); [L1204-L1221] assume !(5 == ~m_run_pc~0); [L1212-L1220] assume !(6 == ~m_run_pc~0); [L1226-L1243] assume !(2 == ~s_run_pc~0); [L1234-L1242] assume !(1 == ~s_run_pc~0); [L1245-L1334] assume !false; [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162-L1166] assume 1 == ~m_run_i~0; [L1163] ~m_run_st~0 := 0; [L1167-L1171] assume 1 == ~s_run_i~0; [L1168] ~s_run_st~0 := 0; [L1172-L1225] assume !(1 == ~m_run_pc~0); [L1180-L1224] assume !(2 == ~m_run_pc~0); [L1188-L1223] assume !(3 == ~m_run_pc~0); [L1196-L1222] assume !(4 == ~m_run_pc~0); [L1204-L1221] assume !(5 == ~m_run_pc~0); [L1212-L1220] assume !(6 == ~m_run_pc~0); [L1226-L1243] assume !(2 == ~s_run_pc~0); [L1234-L1242] assume !(1 == ~s_run_pc~0); [L1245-L1334] assume !false; [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1342] havoc main_~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1361] havoc start_simulation_~kernel_st~0; [L1158] havoc start_simulation_~kernel_st~0; [L1161] start_simulation_~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] start_simulation_~kernel_st~0 := 1; [L1249] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1104] havoc eval_~tmp~0; [L1105] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [L1342] havoc ~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1158] havoc ~kernel_st~0; [L1161] ~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] ~kernel_st~0 := 1; [L1104] havoc ~tmp~0; [L1105] havoc ~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L20] ~s_run_st~0 := 0; [L21] ~s_run_i~0 := 0; [L22] ~s_run_pc~0 := 0; [L23] ~c_m_lock~0 := 0; [L24] ~c_m_ev~0 := 0; [L25] ~c_req_type~0 := 0; [L26] ~c_req_a~0 := 0; [L27] ~c_req_d~0 := 0; [L28] ~c_rsp_type~0 := 0; [L29] ~c_rsp_status~0 := 0; [L30] ~c_rsp_d~0 := 0; [L31] ~c_empty_req~0 := 0; [L32] ~c_empty_rsp~0 := 0; [L33] ~c_read_req_ev~0 := 0; [L34] ~c_write_req_ev~0 := 0; [L35] ~c_read_rsp_ev~0 := 0; [L36] ~c_write_rsp_ev~0 := 0; [L37] ~d_t~0 := 0; [L38] ~a_t~0 := 0; [L39] ~req_t_type~0 := 0; [L40] ~req_t_a~0 := 0; [L41] ~req_t_d~0 := 0; [L42] ~rsp_t_type~0 := 0; [L43] ~rsp_t_status~0 := 0; [L44] ~rsp_t_d~0 := 0; [L45] ~req_tt_type~0 := 0; [L46] ~req_tt_a~0 := 0; [L47] ~req_tt_d~0 := 0; [L48] ~rsp_tt_type~0 := 0; [L49] ~rsp_tt_status~0 := 0; [L50] ~rsp_tt_d~0 := 0; [L835] ~req_t_type___0~0 := 0; [L836] ~req_t_a___0~0 := 0; [L837] ~req_t_d___0~0 := 0; [L838] ~rsp_t_type___0~0 := 0; [L839] ~rsp_t_status___0~0 := 0; [L840] ~rsp_t_d___0~0 := 0; [L1342] havoc ~__retres1~0; [L1346] ~c_m_lock~0 := 0; [L1347] ~c_m_ev~0 := 2; [L1349] ~m_run_i~0 := 1; [L1350] ~m_run_pc~0 := 0; [L1351] ~s_run_i~0 := 1; [L1352] ~s_run_pc~0 := 0; [L1353] ~c_empty_req~0 := 1; [L1354] ~c_empty_rsp~0 := 1; [L1355] ~c_read_req_ev~0 := 2; [L1356] ~c_write_req_ev~0 := 2; [L1357] ~c_read_rsp_ev~0 := 2; [L1358] ~c_write_rsp_ev~0 := 2; [L1359] ~c_m_lock~0 := 0; [L1360] ~c_m_ev~0 := 2; [L1158] havoc ~kernel_st~0; [L1161] ~kernel_st~0 := 0; [L1162] COND TRUE 1 == ~m_run_i~0 [L1163] ~m_run_st~0 := 0; [L1167] COND TRUE 1 == ~s_run_i~0 [L1168] ~s_run_st~0 := 0; [L1172] COND FALSE !(1 == ~m_run_pc~0) [L1180] COND FALSE !(2 == ~m_run_pc~0) [L1188] COND FALSE !(3 == ~m_run_pc~0) [L1196] COND FALSE !(4 == ~m_run_pc~0) [L1204] COND FALSE !(5 == ~m_run_pc~0) [L1212] COND FALSE !(6 == ~m_run_pc~0) [L1226] COND FALSE !(2 == ~s_run_pc~0) [L1234] COND FALSE !(1 == ~s_run_pc~0) [L1245-L1334] COND FALSE !(false) [L1248] ~kernel_st~0 := 1; [L1104] havoc ~tmp~0; [L1105] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L20] int s_run_st ; [L21] int s_run_i ; [L22] int s_run_pc ; [L23] int c_m_lock ; [L24] int c_m_ev ; [L25] int c_req_type ; [L26] int c_req_a ; [L27] int c_req_d ; [L28] int c_rsp_type ; [L29] int c_rsp_status ; [L30] int c_rsp_d ; [L31] int c_empty_req ; [L32] int c_empty_rsp ; [L33] int c_read_req_ev ; [L34] int c_write_req_ev ; [L35] int c_read_rsp_ev ; [L36] int c_write_rsp_ev ; [L37] static int d_t ; [L38] static int a_t ; [L39] static int req_t_type ; [L40] static int req_t_a ; [L41] static int req_t_d ; [L42] static int rsp_t_type ; [L43] static int rsp_t_status ; [L44] static int rsp_t_d ; [L45] static int req_tt_type ; [L46] static int req_tt_a ; [L47] static int req_tt_d ; [L48] static int rsp_tt_type ; [L49] static int rsp_tt_status ; [L50] static int rsp_tt_d ; [L835] static int req_t_type___0 ; [L836] static int req_t_a___0 ; [L837] static int req_t_d___0 ; [L838] static int rsp_t_type___0 ; [L839] static int rsp_t_status___0 ; [L840] static int rsp_t_d___0 ; [L1342] int __retres1 ; [L1346] c_m_lock = 0 [L1347] c_m_ev = 2 [L1349] m_run_i = 1 [L1350] m_run_pc = 0 [L1351] s_run_i = 1 [L1352] s_run_pc = 0 [L1353] c_empty_req = 1 [L1354] c_empty_rsp = 1 [L1355] c_read_req_ev = 2 [L1356] c_write_req_ev = 2 [L1357] c_read_rsp_ev = 2 [L1358] c_write_rsp_ev = 2 [L1359] c_m_lock = 0 [L1360] c_m_ev = 2 [L1158] int kernel_st ; [L1161] kernel_st = 0 [L1162] COND TRUE (int )m_run_i == 1 [L1163] m_run_st = 0 [L1167] COND TRUE (int )s_run_i == 1 [L1168] s_run_st = 0 [L1172] COND FALSE !((int )m_run_pc == 1) [L1180] COND FALSE !((int )m_run_pc == 2) [L1188] COND FALSE !((int )m_run_pc == 3) [L1196] COND FALSE !((int )m_run_pc == 4) [L1204] COND FALSE !((int )m_run_pc == 5) [L1212] COND FALSE !((int )m_run_pc == 6) [L1226] COND FALSE !((int )s_run_pc == 2) [L1234] COND FALSE !((int )s_run_pc == 1) [L1245] COND TRUE 1 [L1248] kernel_st = 1 [L1104] int tmp ; [L1105] int tmp___0 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~m_run_st~0; [?] assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___0~0); [L1109-L1150] assume !false; [L1111-L1119] assume 0 == ~m_run_st~0; [L1120-L1134] assume 0 == ~m_run_st~0; [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] assume !(0 != eval_~tmp~0); [L1135-L1149] assume 0 == ~s_run_st~0; [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1109-L1150] assume !false; [L1111-L1119] assume 0 == ~m_run_st~0; [L1120-L1134] assume 0 == ~m_run_st~0; [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] assume !(0 != eval_~tmp~0); [L1135-L1149] assume 0 == ~s_run_st~0; [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] assume !(0 != eval_~tmp___0~0); [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] COND FALSE !(0 != eval_~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] eval_~tmp~0 := eval_#t~nondet1; [L1122] havoc eval_#t~nondet1; [L1124-L1131] COND FALSE !(0 != eval_~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] eval_~tmp___0~0 := eval_#t~nondet2; [L1137] havoc eval_#t~nondet2; [L1139-L1146] COND FALSE !(0 != eval_~tmp___0~0) [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] ~tmp~0 := #t~nondet1; [L1122] havoc #t~nondet1; [L1124-L1131] COND FALSE !(0 != ~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] ~tmp___0~0 := #t~nondet2; [L1137] havoc #t~nondet2; [L1139-L1146] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1109-L1150] COND FALSE !(false) [L1111] COND TRUE 0 == ~m_run_st~0 [L1120] COND TRUE 0 == ~m_run_st~0 [L1122] ~tmp~0 := #t~nondet1; [L1122] havoc #t~nondet1; [L1124-L1131] COND FALSE !(0 != ~tmp~0) [L1135] COND TRUE 0 == ~s_run_st~0 [L1137] ~tmp___0~0 := #t~nondet2; [L1137] havoc #t~nondet2; [L1139-L1146] COND FALSE !(0 != ~tmp___0~0) [L1109] COND TRUE 1 [L1111] COND TRUE (int )m_run_st == 0 [L1120] COND TRUE (int )m_run_st == 0 [L1122] tmp = __VERIFIER_nondet_int() [L1124] COND FALSE !(\read(tmp)) [L1135] COND TRUE (int )s_run_st == 0 [L1137] tmp___0 = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp___0)) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L20] int s_run_st ; [L21] int s_run_i ; [L22] int s_run_pc ; [L23] int c_m_lock ; [L24] int c_m_ev ; [L25] int c_req_type ; [L26] int c_req_a ; [L27] int c_req_d ; [L28] int c_rsp_type ; [L29] int c_rsp_status ; [L30] int c_rsp_d ; [L31] int c_empty_req ; [L32] int c_empty_rsp ; [L33] int c_read_req_ev ; [L34] int c_write_req_ev ; [L35] int c_read_rsp_ev ; [L36] int c_write_rsp_ev ; [L37] static int d_t ; [L38] static int a_t ; [L39] static int req_t_type ; [L40] static int req_t_a ; [L41] static int req_t_d ; [L42] static int rsp_t_type ; [L43] static int rsp_t_status ; [L44] static int rsp_t_d ; [L45] static int req_tt_type ; [L46] static int req_tt_a ; [L47] static int req_tt_d ; [L48] static int rsp_tt_type ; [L49] static int rsp_tt_status ; [L50] static int rsp_tt_d ; [L835] static int req_t_type___0 ; [L836] static int req_t_a___0 ; [L837] static int req_t_d___0 ; [L838] static int rsp_t_type___0 ; [L839] static int rsp_t_status___0 ; [L840] static int rsp_t_d___0 ; [L1342] int __retres1 ; [L1346] c_m_lock = 0 [L1347] c_m_ev = 2 [L1349] m_run_i = 1 [L1350] m_run_pc = 0 [L1351] s_run_i = 1 [L1352] s_run_pc = 0 [L1353] c_empty_req = 1 [L1354] c_empty_rsp = 1 [L1355] c_read_req_ev = 2 [L1356] c_write_req_ev = 2 [L1357] c_read_rsp_ev = 2 [L1358] c_write_rsp_ev = 2 [L1359] c_m_lock = 0 [L1360] c_m_ev = 2 [L1158] int kernel_st ; [L1161] kernel_st = 0 [L1162] COND TRUE (int )m_run_i == 1 [L1163] m_run_st = 0 [L1167] COND TRUE (int )s_run_i == 1 [L1168] s_run_st = 0 [L1172] COND FALSE !((int )m_run_pc == 1) [L1180] COND FALSE !((int )m_run_pc == 2) [L1188] COND FALSE !((int )m_run_pc == 3) [L1196] COND FALSE !((int )m_run_pc == 4) [L1204] COND FALSE !((int )m_run_pc == 5) [L1212] COND FALSE !((int )m_run_pc == 6) [L1226] COND FALSE !((int )s_run_pc == 2) [L1234] COND FALSE !((int )s_run_pc == 1) [L1245] COND TRUE 1 [L1248] kernel_st = 1 [L1104] int tmp ; [L1105] int tmp___0 ; Loop: [L1109] COND TRUE 1 [L1111] COND TRUE (int )m_run_st == 0 [L1120] COND TRUE (int )m_run_st == 0 [L1122] tmp = __VERIFIER_nondet_int() [L1124] COND FALSE !(\read(tmp)) [L1135] COND TRUE (int )s_run_st == 0 [L1137] tmp___0 = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...