./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.4_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_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.4_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/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 f57f15044da25a93146142338d05dda549829eb1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 03:41:20,528 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:41:20,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:41:20,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:41:20,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:41:20,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:41:20,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:41:20,541 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:41:20,542 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:41:20,543 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:41:20,543 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:41:20,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:41:20,544 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:41:20,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:41:20,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:41:20,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:41:20,547 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:41:20,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:41:20,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:41:20,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:41:20,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:41:20,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:41:20,555 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:41:20,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:41:20,556 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:41:20,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:41:20,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:41:20,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:41:20,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:41:20,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:41:20,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:41:20,560 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:41:20,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:41:20,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:41:20,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:41:20,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:41:20,562 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 03:41:20,574 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:41:20,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:41:20,575 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:41:20,575 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:41:20,575 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:41:20,575 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:41:20,575 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:41:20,575 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:41:20,576 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:41:20,576 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:41:20,576 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:41:20,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:41:20,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:41:20,576 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:41:20,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:41:20,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:41:20,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:41:20,578 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:41:20,578 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:41:20,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:41:20,579 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:41:20,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:41:20,579 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:41:20,579 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:41:20,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:41:20,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:41:20,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:41:20,580 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:41:20,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:41:20,580 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:41:20,580 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:41:20,581 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:41:20,581 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_31d677ac-c697-45da-b143-481764c0806a/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 -> f57f15044da25a93146142338d05dda549829eb1 [2018-11-23 03:41:20,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:41:20,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:41:20,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:41:20,613 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:41:20,613 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:41:20,614 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.4_true-unreach-call_false-termination.cil.c [2018-11-23 03:41:20,651 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/data/bd40101fd/819d5acb998e45b7b6e4d17d67271ccc/FLAGfad2eb535 [2018-11-23 03:41:20,998 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:41:20,998 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/sv-benchmarks/c/systemc/mem_slave_tlm.4_true-unreach-call_false-termination.cil.c [2018-11-23 03:41:21,006 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/data/bd40101fd/819d5acb998e45b7b6e4d17d67271ccc/FLAGfad2eb535 [2018-11-23 03:41:21,017 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/data/bd40101fd/819d5acb998e45b7b6e4d17d67271ccc [2018-11-23 03:41:21,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:41:21,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:41:21,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:41:21,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:41:21,023 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:41:21,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f3324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21, skipping insertion in model container [2018-11-23 03:41:21,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:41:21,067 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:41:21,246 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:41:21,249 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:41:21,300 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:41:21,314 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:41:21,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21 WrapperNode [2018-11-23 03:41:21,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:41:21,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:41:21,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:41:21,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:41:21,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:41:21,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:41:21,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:41:21,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:41:21,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... [2018-11-23 03:41:21,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:41:21,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:41:21,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:41:21,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:41:21,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/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 03:41:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:41:21,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:41:22,238 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:41:22,238 INFO L280 CfgBuilder]: Removed 39 assue(true) statements. [2018-11-23 03:41:22,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:41:22 BoogieIcfgContainer [2018-11-23 03:41:22,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:41:22,240 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:41:22,240 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:41:22,243 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:41:22,244 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:41:22,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:41:21" (1/3) ... [2018-11-23 03:41:22,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20be598a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:41:22, skipping insertion in model container [2018-11-23 03:41:22,245 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:41:22,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:41:21" (2/3) ... [2018-11-23 03:41:22,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20be598a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:41:22, skipping insertion in model container [2018-11-23 03:41:22,245 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:41:22,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:41:22" (3/3) ... [2018-11-23 03:41:22,247 INFO L375 chiAutomizerObserver]: Analyzing ICFG mem_slave_tlm.4_true-unreach-call_false-termination.cil.c [2018-11-23 03:41:22,281 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:41:22,282 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:41:22,282 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:41:22,282 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:41:22,282 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:41:22,282 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:41:22,282 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:41:22,282 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:41:22,283 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:41:22,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states. [2018-11-23 03:41:22,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2018-11-23 03:41:22,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:41:22,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:41:22,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:22,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:22,329 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:41:22,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states. [2018-11-23 03:41:22,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 247 [2018-11-23 03:41:22,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:41:22,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:41:22,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:22,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:22,344 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRYtrue ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; 16#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; 3#L1177true assume !(1 == ~m_run_i~0);~m_run_st~0 := 2; 8#L1177-2true assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 41#L1182-1true assume 1 == ~m_run_pc~0; 4#L1188true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 137#L1227true assume !(2 == ~s_run_pc~0); 46#L1248true assume !(1 == ~s_run_pc~0); 111#L1343-1true [2018-11-23 03:41:22,344 INFO L796 eck$LassoCheckResult]: Loop: 111#L1343-1true assume !false; 80#L1261true 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; 129#L1150true assume !true; 5#L1166true start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 266#L1268true assume 1 == ~m_run_pc~0; 229#L1269true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 69#L1308true assume !(2 == ~s_run_pc~0); 250#L1329true assume !(1 == ~s_run_pc~0); 67#L1330true assume 0 == ~m_run_st~0; 111#L1343-1true [2018-11-23 03:41:22,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:22,348 INFO L82 PathProgramCache]: Analyzing trace with hash 180491512, now seen corresponding path program 1 times [2018-11-23 03:41:22,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:22,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:22,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:22,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:22,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:41:22,446 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 03:41:22,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:41:22,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:41:22,451 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:41:22,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:22,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1546735872, now seen corresponding path program 1 times [2018-11-23 03:41:22,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:22,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:41:22,455 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 03:41:22,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:41:22,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:41:22,457 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:41:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:41:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:41:22,467 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 3 states. [2018-11-23 03:41:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:41:22,493 INFO L93 Difference]: Finished difference Result 271 states and 467 transitions. [2018-11-23 03:41:22,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:41:22,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 467 transitions. [2018-11-23 03:41:22,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 242 [2018-11-23 03:41:22,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 262 states and 458 transitions. [2018-11-23 03:41:22,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 262 [2018-11-23 03:41:22,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2018-11-23 03:41:22,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 262 states and 458 transitions. [2018-11-23 03:41:22,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:41:22,509 INFO L705 BuchiCegarLoop]: Abstraction has 262 states and 458 transitions. [2018-11-23 03:41:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states and 458 transitions. [2018-11-23 03:41:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2018-11-23 03:41:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-23 03:41:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 458 transitions. [2018-11-23 03:41:22,544 INFO L728 BuchiCegarLoop]: Abstraction has 262 states and 458 transitions. [2018-11-23 03:41:22,544 INFO L608 BuchiCegarLoop]: Abstraction has 262 states and 458 transitions. [2018-11-23 03:41:22,544 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:41:22,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 458 transitions. [2018-11-23 03:41:22,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 242 [2018-11-23 03:41:22,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:41:22,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:41:22,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:22,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:22,547 INFO L794 eck$LassoCheckResult]: Stem: 736#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; 582#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; 551#L1177 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 552#L1177-2 assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 563#L1182-1 assume 1 == ~m_run_pc~0; 553#L1188 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 554#L1227 assume !(2 == ~s_run_pc~0); 642#L1248 assume !(1 == ~s_run_pc~0); 644#L1343-1 [2018-11-23 03:41:22,547 INFO L796 eck$LassoCheckResult]: Loop: 644#L1343-1 assume !false; 702#L1261 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; 665#L1150 assume !false; 756#L1125 assume !(0 == ~m_run_st~0); 799#L1129 assume !(0 == ~s_run_st~0); 556#L1166 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 557#L1268 assume 1 == ~m_run_pc~0; 812#L1269 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 589#L1308 assume !(2 == ~s_run_pc~0); 685#L1329 assume !(1 == ~s_run_pc~0); 587#L1330 assume 0 == ~m_run_st~0; 644#L1343-1 [2018-11-23 03:41:22,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash 123233210, now seen corresponding path program 1 times [2018-11-23 03:41:22,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:22,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:22,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:22,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:22,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:41:22,586 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 03:41:22,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:41:22,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:41:22,587 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:41:22,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1056008073, now seen corresponding path program 1 times [2018-11-23 03:41:22,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:22,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:22,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:22,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:22,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:22,643 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:41:22,643 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:41:22,643 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:41:22,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:41:22,644 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:41:22,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:41:22,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:41:22,644 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:41:22,644 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.4_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-23 03:41:22,644 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:41:22,645 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:41:22,657 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 03:41:22,670 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 03:41:22,671 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 03:41:22,674 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 03:41:22,676 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 03:41:22,685 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 03:41:22,686 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 03:41:22,688 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 03:41:22,689 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 03:41:22,691 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 03:41:22,773 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:41:22,774 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/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 03:41:22,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:41:22,783 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/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 03:41:22,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:41:22,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:41:22,825 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:41:22,826 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:41:22,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:41:22,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:41:22,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:41:22,826 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:41:22,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:41:22,827 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:41:22,827 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:41:22,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.4_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-23 03:41:22,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:41:22,827 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:41:22,828 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 03:41:22,831 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 03:41:22,833 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 03:41:22,846 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 03:41:22,848 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 03:41:22,850 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 03:41:22,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:41:22,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:41:22,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:41:22,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:41:22,931 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:41:22,934 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:41:22,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:22,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,937 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:22,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,938 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:22,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:22,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:22,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:22,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,951 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:22,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,952 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:22,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:22,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,954 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:22,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,955 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:22,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:22,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:22,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:22,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:22,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:22,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:22,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:22,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:22,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:22,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:22,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:22,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:22,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:22,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,976 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 03:41:22,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:22,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,977 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:22,977 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:22,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:22,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:22,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,986 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:22,986 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:22,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:22,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,988 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:22,989 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:22,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:22,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:22,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,991 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:22,991 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:22,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:22,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:22,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,995 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:22,995 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:22,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:22,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:22,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:22,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:22,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:22,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:22,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:22,999 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,000 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,004 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,004 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,007 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,007 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,011 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,011 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,014 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,014 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,015 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 03:41:23,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,016 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,017 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,018 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:23,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,026 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,027 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,029 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,029 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,030 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:23,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,032 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,032 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,033 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:23,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,035 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,035 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,039 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,044 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,044 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,047 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,051 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,052 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,054 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,054 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,055 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 03:41:23,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,057 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,057 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,058 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:23,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,067 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,068 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,070 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,070 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,071 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:23,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,073 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,075 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,075 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:23,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,079 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,079 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,084 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,084 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,089 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,090 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,092 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,093 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,097 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,097 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:23,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,099 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,100 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,101 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 03:41:23,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,102 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,102 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,102 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,111 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,111 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,112 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,112 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,114 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,114 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,114 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,114 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,117 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,117 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,117 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,117 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,131 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,132 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,133 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,138 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,138 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,139 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,143 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,144 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,145 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,146 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,146 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,147 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,147 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,151 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,151 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,152 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,154 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,154 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:23,155 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:23,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,156 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 03:41:23,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,157 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,157 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,159 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,161 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:23,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,172 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,173 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,174 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,176 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,177 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,177 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,178 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:23,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,186 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,186 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,186 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,188 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:23,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,193 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,193 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,194 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,194 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,198 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,198 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,199 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,199 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,204 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,205 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,205 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,207 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,208 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,208 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,209 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,213 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,213 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,213 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,214 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,216 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,216 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:23,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,217 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,218 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 03:41:23,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,219 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,219 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,220 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,222 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:23,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,231 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,232 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,233 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,234 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,235 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,235 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,236 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:23,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,238 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,238 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,238 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,238 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,240 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:23,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,248 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,249 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,250 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,256 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,256 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,257 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,264 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,264 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,266 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,267 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,268 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,268 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,270 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,275 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,275 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,277 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,278 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,279 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,279 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:23,280 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:23,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,281 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 03:41:23,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,283 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,283 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,283 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:23,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,290 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,291 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,291 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,294 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,294 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,294 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,295 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:23,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,299 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,299 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,300 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,300 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,301 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:23,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,308 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,309 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,309 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,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 03:41:23,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,312 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,313 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,318 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,318 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,319 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,321 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,322 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,322 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,326 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,326 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,326 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,327 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,329 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:23,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,330 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:23,330 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:23,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,332 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 03:41:23,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,333 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,334 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,334 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,335 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:41:23,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,355 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,355 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,360 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,360 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,360 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,361 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:41:23,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,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 03:41:23,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,364 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,365 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:23,365 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,366 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:41:23,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,375 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,376 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,380 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,381 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,389 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,389 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,390 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,435 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,435 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:23,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,441 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:23,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:23,444 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:23,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:23,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:23,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:23,445 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:23,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:23,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:23,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:23,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:41:23,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:41:23,449 INFO L87 Difference]: Start difference. First operand 262 states and 458 transitions. cyclomatic complexity: 197 Second operand 3 states. [2018-11-23 03:41:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:41:23,469 INFO L93 Difference]: Finished difference Result 262 states and 457 transitions. [2018-11-23 03:41:23,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:41:23,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 262 states and 457 transitions. [2018-11-23 03:41:23,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 242 [2018-11-23 03:41:23,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 262 states to 262 states and 457 transitions. [2018-11-23 03:41:23,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 262 [2018-11-23 03:41:23,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2018-11-23 03:41:23,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 262 states and 457 transitions. [2018-11-23 03:41:23,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:41:23,479 INFO L705 BuchiCegarLoop]: Abstraction has 262 states and 457 transitions. [2018-11-23 03:41:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states and 457 transitions. [2018-11-23 03:41:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2018-11-23 03:41:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-23 03:41:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 457 transitions. [2018-11-23 03:41:23,488 INFO L728 BuchiCegarLoop]: Abstraction has 262 states and 457 transitions. [2018-11-23 03:41:23,488 INFO L608 BuchiCegarLoop]: Abstraction has 262 states and 457 transitions. [2018-11-23 03:41:23,488 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:41:23,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 457 transitions. [2018-11-23 03:41:23,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 242 [2018-11-23 03:41:23,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:41:23,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:41:23,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:23,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:23,491 INFO L794 eck$LassoCheckResult]: Stem: 1266#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; 1112#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#L1177 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 1082#L1177-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 1095#L1182-1 assume 1 == ~m_run_pc~0; 1083#L1188 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1084#L1227 assume !(2 == ~s_run_pc~0); 1172#L1248 assume !(1 == ~s_run_pc~0); 1174#L1343-1 [2018-11-23 03:41:23,491 INFO L796 eck$LassoCheckResult]: Loop: 1174#L1343-1 assume !false; 1232#L1261 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; 1195#L1150 assume !false; 1286#L1125 assume !(0 == ~m_run_st~0); 1329#L1129 assume !(0 == ~s_run_st~0); 1086#L1166 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 1087#L1268 assume 1 == ~m_run_pc~0; 1342#L1269 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1119#L1308 assume 2 == ~s_run_pc~0; 1216#L1323 assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 1117#L1330 assume 0 == ~m_run_st~0; 1174#L1343-1 [2018-11-23 03:41:23,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash 121386168, now seen corresponding path program 1 times [2018-11-23 03:41:23,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:23,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:41:23,513 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 03:41:23,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:41:23,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:41:23,514 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:41:23,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:23,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1056016288, now seen corresponding path program 1 times [2018-11-23 03:41:23,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:23,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:23,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:23,587 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:41:23,587 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:41:23,587 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:41:23,587 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:41:23,587 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:41:23,587 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:41:23,587 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:41:23,587 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:41:23,587 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.4_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 03:41:23,588 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:41:23,588 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:41:23,589 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 03:41:23,591 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 03:41:23,593 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 03:41:23,603 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 03:41:23,605 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 03:41:23,606 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 03:41:23,607 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 03:41:23,610 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 03:41:23,611 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 03:41:23,613 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 03:41:23,614 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 03:41:23,679 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:41:23,679 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/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 03:41:23,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:41:23,681 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:41:23,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:41:23,695 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_pc~0=2} Honda state: {~s_run_pc~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/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 03:41:23,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:41:23,712 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:41:23,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:41:23,715 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_31d677ac-c697-45da-b143-481764c0806a/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 03:41:23,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:41:23,730 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:41:23,750 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:41:23,750 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_31d677ac-c697-45da-b143-481764c0806a/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 03:41:23,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:41:23,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:41:23,793 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:41:23,794 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_31d677ac-c697-45da-b143-481764c0806a/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 03:41:23,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:41:23,821 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:41:23,830 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:41:23,830 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_write_req_ev~0=1} Honda state: {~c_write_req_ev~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/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 03:41:23,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:41:23,850 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:41:23,853 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:41:23,853 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_31d677ac-c697-45da-b143-481764c0806a/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 03:41:23,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:41:23,869 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/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 03:41:23,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:41:23,887 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:41:23,907 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:41:23,909 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:41:23,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:41:23,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:41:23,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:41:23,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:41:23,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:41:23,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:41:23,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:41:23,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.4_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 03:41:23,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:41:23,909 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:41:23,910 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 03:41:23,913 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 03:41:23,915 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 03:41:23,926 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 03:41:23,928 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 03:41:23,929 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 03:41:23,930 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 03:41:23,933 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 03:41:23,937 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 03:41:23,942 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 03:41:23,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 03:41:24,029 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:41:24,029 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:41:24,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:24,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:24,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:24,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:24,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:24,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:24,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:24,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,043 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,043 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,044 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,045 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:24,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:41:24,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:41:24,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,047 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 03:41:24,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,048 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,048 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,050 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,050 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,052 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,052 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,054 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,054 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,056 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,056 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,058 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,058 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,060 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,060 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,062 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,062 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,065 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,065 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,068 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,069 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,070 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,070 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,071 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 03:41:24,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,072 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,072 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,074 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,075 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,078 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,079 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,082 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,082 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,084 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,086 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,088 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,088 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,089 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:24,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,092 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,092 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,093 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:24,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,096 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,097 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,098 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,098 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,099 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 03:41:24,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,100 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,100 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,103 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,103 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,106 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,106 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,108 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,108 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,111 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,111 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,113 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,115 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,116 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,118 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,118 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,118 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:24,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,122 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,122 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,123 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:24,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,126 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,126 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:41:24,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,128 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,128 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,129 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 03:41:24,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,129 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,130 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,130 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,133 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,133 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,133 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,136 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,136 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,137 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,138 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,139 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,139 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,142 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,142 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,142 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,145 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,145 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,145 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,147 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,147 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,147 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,150 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,151 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,151 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,156 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,156 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,161 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,162 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,162 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,164 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,164 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:41:24,164 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:41:24,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,165 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 03:41:24,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,166 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,166 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,167 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,171 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,171 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,172 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,176 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,176 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,179 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,179 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,183 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,184 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,189 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,189 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,190 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,192 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,193 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,193 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,198 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,198 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,198 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,198 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,200 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:24,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,208 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,208 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,208 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,210 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:24,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,217 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,218 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,218 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,220 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,220 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:41:24,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,220 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,221 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,222 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 03:41:24,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,223 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,223 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,224 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,229 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,230 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,230 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,231 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,236 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,236 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,237 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,238 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,239 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,240 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,240 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,246 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,246 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,247 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,252 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,253 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,253 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,255 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,255 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,256 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,261 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,261 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,261 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,262 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,263 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:24,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,272 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,273 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,273 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,273 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,274 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:41:24,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,284 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,284 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,285 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,286 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,287 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,287 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:41:24,288 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:41:24,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,288 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 03:41:24,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,289 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,289 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,290 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,290 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,292 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,292 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,293 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,293 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,296 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,296 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,297 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,297 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,299 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,299 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,299 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,300 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,302 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,302 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,302 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,303 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,305 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,305 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,306 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,308 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,308 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,308 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,311 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,311 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,311 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,312 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:24,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,316 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,317 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,317 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,317 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:41:24,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,322 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,323 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,323 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,325 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:41:24,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,325 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:41:24,325 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:41:24,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,327 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 03:41:24,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,327 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,327 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,328 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,332 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,332 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,332 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,337 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,337 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,338 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,341 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,341 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,342 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,345 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,346 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,349 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,350 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,353 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,354 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,357 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,358 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,358 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,359 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:41:24,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:41:24,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,367 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,367 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:41:24,367 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,368 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:41:24,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,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 03:41:24,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,378 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,379 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:41:24,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:41:24,382 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:41:24,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:41:24,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:41:24,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:41:24,382 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:41:24,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:41:24,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:41:24,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:41:24,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:41:24,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:41:24,385 INFO L87 Difference]: Start difference. First operand 262 states and 457 transitions. cyclomatic complexity: 196 Second operand 3 states. [2018-11-23 03:41:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:41:24,857 INFO L93 Difference]: Finished difference Result 438 states and 686 transitions. [2018-11-23 03:41:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:41:24,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 686 transitions. [2018-11-23 03:41:24,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 424 [2018-11-23 03:41:24,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 438 states and 686 transitions. [2018-11-23 03:41:24,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 438 [2018-11-23 03:41:24,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 438 [2018-11-23 03:41:24,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 438 states and 686 transitions. [2018-11-23 03:41:24,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:41:24,867 INFO L705 BuchiCegarLoop]: Abstraction has 438 states and 686 transitions. [2018-11-23 03:41:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 686 transitions. [2018-11-23 03:41:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 432. [2018-11-23 03:41:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-11-23 03:41:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 680 transitions. [2018-11-23 03:41:24,877 INFO L728 BuchiCegarLoop]: Abstraction has 432 states and 680 transitions. [2018-11-23 03:41:24,877 INFO L608 BuchiCegarLoop]: Abstraction has 432 states and 680 transitions. [2018-11-23 03:41:24,877 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:41:24,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 432 states and 680 transitions. [2018-11-23 03:41:24,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 418 [2018-11-23 03:41:24,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:41:24,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:41:24,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:24,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:24,880 INFO L794 eck$LassoCheckResult]: Stem: 1969#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; 1813#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; 1787#L1177 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 1788#L1177-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 1795#L1182-1 assume !(1 == ~m_run_pc~0); 1862#L1194 assume !(2 == ~m_run_pc~0); 2004#L1202 assume !(3 == ~m_run_pc~0); 1831#L1210 assume !(4 == ~m_run_pc~0); 1832#L1218 assume !(5 == ~m_run_pc~0); 1874#L1226 assume !(6 == ~m_run_pc~0); 1875#L1227 assume !(2 == ~s_run_pc~0); 1871#L1248 assume !(1 == ~s_run_pc~0); 1873#L1343-1 [2018-11-23 03:41:24,880 INFO L796 eck$LassoCheckResult]: Loop: 1873#L1343-1 assume !false; 1930#L1261 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; 1891#L1150 assume !false; 1992#L1125 assume !(0 == ~m_run_st~0); 2057#L1129 assume !(0 == ~s_run_st~0); 2059#L1166 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 2217#L1268 assume !(1 == ~m_run_pc~0); 2216#L1275 assume !(2 == ~m_run_pc~0); 2215#L1283 assume !(3 == ~m_run_pc~0); 2214#L1291 assume !(4 == ~m_run_pc~0); 2213#L1299 assume !(5 == ~m_run_pc~0); 2087#L1307 assume !(6 == ~m_run_pc~0); 1911#L1308 assume !(2 == ~s_run_pc~0); 1912#L1329 assume !(1 == ~s_run_pc~0); 1817#L1330 assume 0 == ~m_run_st~0; 1873#L1343-1 [2018-11-23 03:41:24,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1577837401, now seen corresponding path program 1 times [2018-11-23 03:41:24,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:24,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:24,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash 972150774, now seen corresponding path program 1 times [2018-11-23 03:41:24,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:24,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:24,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:41:24,907 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 03:41:24,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:41:24,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:41:24,908 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:41:24,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:41:24,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:41:24,908 INFO L87 Difference]: Start difference. First operand 432 states and 680 transitions. cyclomatic complexity: 249 Second operand 3 states. [2018-11-23 03:41:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:41:25,007 INFO L93 Difference]: Finished difference Result 700 states and 1125 transitions. [2018-11-23 03:41:25,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:41:25,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 1125 transitions. [2018-11-23 03:41:25,013 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 677 [2018-11-23 03:41:25,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 700 states and 1125 transitions. [2018-11-23 03:41:25,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 700 [2018-11-23 03:41:25,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 700 [2018-11-23 03:41:25,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 700 states and 1125 transitions. [2018-11-23 03:41:25,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:41:25,019 INFO L705 BuchiCegarLoop]: Abstraction has 700 states and 1125 transitions. [2018-11-23 03:41:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states and 1125 transitions. [2018-11-23 03:41:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 694. [2018-11-23 03:41:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-11-23 03:41:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1119 transitions. [2018-11-23 03:41:25,035 INFO L728 BuchiCegarLoop]: Abstraction has 694 states and 1119 transitions. [2018-11-23 03:41:25,035 INFO L608 BuchiCegarLoop]: Abstraction has 694 states and 1119 transitions. [2018-11-23 03:41:25,035 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:41:25,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 694 states and 1119 transitions. [2018-11-23 03:41:25,038 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 671 [2018-11-23 03:41:25,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:41:25,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:41:25,039 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:25,039 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 03:41:25,040 INFO L794 eck$LassoCheckResult]: Stem: 3109#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; 2951#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; 2925#L1177 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 2926#L1177-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 2933#L1182-1 assume !(1 == ~m_run_pc~0); 3002#L1194 assume !(2 == ~m_run_pc~0); 3147#L1202 assume !(3 == ~m_run_pc~0); 2971#L1210 assume !(4 == ~m_run_pc~0); 2972#L1218 assume !(5 == ~m_run_pc~0); 3015#L1226 assume !(6 == ~m_run_pc~0); 3016#L1227 assume !(2 == ~s_run_pc~0); 3012#L1248 assume !(1 == ~s_run_pc~0); 3014#L1343-1 assume !false; 3382#L1261 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; 3380#L1150 [2018-11-23 03:41:25,040 INFO L796 eck$LassoCheckResult]: Loop: 3380#L1150 assume !false; 3378#L1125 assume 0 == ~m_run_st~0; 3379#L1129-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 3131#L1139 assume !(0 != eval_~tmp~0); 3132#L1135 assume !(0 == ~s_run_st~0); 3380#L1150 [2018-11-23 03:41:25,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 1 times [2018-11-23 03:41:25,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:25,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash 151895589, now seen corresponding path program 1 times [2018-11-23 03:41:25,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:25,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:25,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:25,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash -840624501, now seen corresponding path program 1 times [2018-11-23 03:41:25,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:25,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:25,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:25,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:41:25,089 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 03:41:25,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:41:25,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:41:25,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:41:25,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:41:25,113 INFO L87 Difference]: Start difference. First operand 694 states and 1119 transitions. cyclomatic complexity: 428 Second operand 3 states. [2018-11-23 03:41:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:41:25,169 INFO L93 Difference]: Finished difference Result 1310 states and 2110 transitions. [2018-11-23 03:41:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:41:25,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 2110 transitions. [2018-11-23 03:41:25,176 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1279 [2018-11-23 03:41:25,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 1310 states and 2110 transitions. [2018-11-23 03:41:25,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1310 [2018-11-23 03:41:25,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1310 [2018-11-23 03:41:25,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1310 states and 2110 transitions. [2018-11-23 03:41:25,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:41:25,185 INFO L705 BuchiCegarLoop]: Abstraction has 1310 states and 2110 transitions. [2018-11-23 03:41:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states and 2110 transitions. [2018-11-23 03:41:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1106. [2018-11-23 03:41:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-11-23 03:41:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1786 transitions. [2018-11-23 03:41:25,198 INFO L728 BuchiCegarLoop]: Abstraction has 1106 states and 1786 transitions. [2018-11-23 03:41:25,198 INFO L608 BuchiCegarLoop]: Abstraction has 1106 states and 1786 transitions. [2018-11-23 03:41:25,198 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:41:25,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1106 states and 1786 transitions. [2018-11-23 03:41:25,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1075 [2018-11-23 03:41:25,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:41:25,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:41:25,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:41:25,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:41:25,203 INFO L794 eck$LassoCheckResult]: Stem: 5121#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; 4964#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; 4937#L1177 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 4938#L1177-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 4947#L1182-1 assume !(1 == ~m_run_pc~0); 5014#L1194 assume !(2 == ~m_run_pc~0); 5167#L1202 assume !(3 == ~m_run_pc~0); 4983#L1210 assume !(4 == ~m_run_pc~0); 4984#L1218 assume !(5 == ~m_run_pc~0); 5025#L1226 assume !(6 == ~m_run_pc~0); 5026#L1227 assume !(2 == ~s_run_pc~0); 5022#L1248 assume !(1 == ~s_run_pc~0); 5024#L1343-1 assume !false; 5431#L1261 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; 5370#L1150 [2018-11-23 03:41:25,203 INFO L796 eck$LassoCheckResult]: Loop: 5370#L1150 assume !false; 5367#L1125 assume 0 == ~m_run_st~0; 5360#L1129-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 5152#L1139 assume !(0 != eval_~tmp~0); 5153#L1135 assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 5350#L1154 assume !(0 != eval_~tmp___0~0); 5370#L1150 [2018-11-23 03:41:25,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:25,204 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 2 times [2018-11-23 03:41:25,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:25,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:25,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:25,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:25,215 INFO L82 PathProgramCache]: Analyzing trace with hash 413786775, now seen corresponding path program 1 times [2018-11-23 03:41:25,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:25,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:25,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:41:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:41:25,220 INFO L82 PathProgramCache]: Analyzing trace with hash -289564943, now seen corresponding path program 1 times [2018-11-23 03:41:25,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:41:25,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:41:25,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:41:25,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:41:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:41:25,596 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 ----- 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_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177-L1181] assume 1 == ~m_run_i~0; [L1178] ~m_run_st~0 := 0; [L1182-L1186] assume 1 == ~s_run_i~0; [L1183] ~s_run_st~0 := 0; [L1187-L1240] assume !(1 == ~m_run_pc~0); [L1195-L1239] assume !(2 == ~m_run_pc~0); [L1203-L1238] assume !(3 == ~m_run_pc~0); [L1211-L1237] assume !(4 == ~m_run_pc~0); [L1219-L1236] assume !(5 == ~m_run_pc~0); [L1227-L1235] assume !(6 == ~m_run_pc~0); [L1241-L1258] assume !(2 == ~s_run_pc~0); [L1249-L1257] assume !(1 == ~s_run_pc~0); [L1260-L1349] assume !false; [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177-L1181] assume 1 == ~m_run_i~0; [L1178] ~m_run_st~0 := 0; [L1182-L1186] assume 1 == ~s_run_i~0; [L1183] ~s_run_st~0 := 0; [L1187-L1240] assume !(1 == ~m_run_pc~0); [L1195-L1239] assume !(2 == ~m_run_pc~0); [L1203-L1238] assume !(3 == ~m_run_pc~0); [L1211-L1237] assume !(4 == ~m_run_pc~0); [L1219-L1236] assume !(5 == ~m_run_pc~0); [L1227-L1235] assume !(6 == ~m_run_pc~0); [L1241-L1258] assume !(2 == ~s_run_pc~0); [L1249-L1257] assume !(1 == ~s_run_pc~0); [L1260-L1349] assume !false; [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [L1357] havoc ~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1173] havoc ~kernel_st~0; [L1176] ~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] ~kernel_st~0 := 1; [L1119] havoc ~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [L1357] havoc ~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1173] havoc ~kernel_st~0; [L1176] ~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] ~kernel_st~0 := 1; [L1119] havoc ~tmp~0; [L1120] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L21] int s_memory3 ; [L23] int s_run_st ; [L24] int s_run_i ; [L25] int s_run_pc ; [L26] int c_m_lock ; [L27] int c_m_ev ; [L28] int c_req_type ; [L29] int c_req_a ; [L30] int c_req_d ; [L31] int c_rsp_type ; [L32] int c_rsp_status ; [L33] int c_rsp_d ; [L34] int c_empty_req ; [L35] int c_empty_rsp ; [L36] int c_read_req_ev ; [L37] int c_write_req_ev ; [L38] int c_read_rsp_ev ; [L39] int c_write_rsp_ev ; [L40] static int d_t ; [L41] static int a_t ; [L42] static int req_t_type ; [L43] static int req_t_a ; [L44] static int req_t_d ; [L45] static int rsp_t_type ; [L46] static int rsp_t_status ; [L47] static int rsp_t_d ; [L48] static int req_tt_type ; [L49] static int req_tt_a ; [L50] static int req_tt_d ; [L51] static int rsp_tt_type ; [L52] static int rsp_tt_status ; [L53] static int rsp_tt_d ; [L850] static int req_t_type___0 ; [L851] static int req_t_a___0 ; [L852] static int req_t_d___0 ; [L853] static int rsp_t_type___0 ; [L854] static int rsp_t_status___0 ; [L855] static int rsp_t_d___0 ; [L1357] int __retres1 ; [L1361] c_m_lock = 0 [L1362] c_m_ev = 2 [L1364] m_run_i = 1 [L1365] m_run_pc = 0 [L1366] s_run_i = 1 [L1367] s_run_pc = 0 [L1368] c_empty_req = 1 [L1369] c_empty_rsp = 1 [L1370] c_read_req_ev = 2 [L1371] c_write_req_ev = 2 [L1372] c_read_rsp_ev = 2 [L1373] c_write_rsp_ev = 2 [L1374] c_m_lock = 0 [L1375] c_m_ev = 2 [L1173] int kernel_st ; [L1176] kernel_st = 0 [L1177] COND TRUE (int )m_run_i == 1 [L1178] m_run_st = 0 [L1182] COND TRUE (int )s_run_i == 1 [L1183] s_run_st = 0 [L1187] COND FALSE !((int )m_run_pc == 1) [L1195] COND FALSE !((int )m_run_pc == 2) [L1203] COND FALSE !((int )m_run_pc == 3) [L1211] COND FALSE !((int )m_run_pc == 4) [L1219] COND FALSE !((int )m_run_pc == 5) [L1227] COND FALSE !((int )m_run_pc == 6) [L1241] COND FALSE !((int )s_run_pc == 2) [L1249] COND FALSE !((int )s_run_pc == 1) [L1260] COND TRUE 1 [L1263] kernel_st = 1 [L1119] int tmp ; [L1120] 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); [L1124-L1165] assume !false; [L1126-L1134] assume 0 == ~m_run_st~0; [L1135-L1149] assume 0 == ~m_run_st~0; [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] assume !(0 != eval_~tmp~0); [L1150-L1164] assume 0 == ~s_run_st~0; [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1124-L1165] assume !false; [L1126-L1134] assume 0 == ~m_run_st~0; [L1135-L1149] assume 0 == ~m_run_st~0; [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] assume !(0 != eval_~tmp~0); [L1150-L1164] assume 0 == ~s_run_st~0; [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] assume !(0 != eval_~tmp___0~0); [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] COND FALSE !(0 != eval_~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] COND FALSE !(0 != eval_~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] COND FALSE !(0 != eval_~tmp___0~0) [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] ~tmp~0 := #t~nondet1; [L1137] havoc #t~nondet1; [L1139-L1146] COND FALSE !(0 != ~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] ~tmp___0~0 := #t~nondet2; [L1152] havoc #t~nondet2; [L1154-L1161] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] ~tmp~0 := #t~nondet1; [L1137] havoc #t~nondet1; [L1139-L1146] COND FALSE !(0 != ~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] ~tmp___0~0 := #t~nondet2; [L1152] havoc #t~nondet2; [L1154-L1161] COND FALSE !(0 != ~tmp___0~0) [L1124] COND TRUE 1 [L1126] COND TRUE (int )m_run_st == 0 [L1135] COND TRUE (int )m_run_st == 0 [L1137] tmp = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp)) [L1150] COND TRUE (int )s_run_st == 0 [L1152] tmp___0 = __VERIFIER_nondet_int() [L1154] COND FALSE !(\read(tmp___0)) ----- [2018-11-23 03:41:25,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:41:25 BoogieIcfgContainer [2018-11-23 03:41:25,702 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:41:25,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:41:25,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:41:25,703 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:41:25,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:41:22" (3/4) ... [2018-11-23 03:41:25,706 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_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177-L1181] assume 1 == ~m_run_i~0; [L1178] ~m_run_st~0 := 0; [L1182-L1186] assume 1 == ~s_run_i~0; [L1183] ~s_run_st~0 := 0; [L1187-L1240] assume !(1 == ~m_run_pc~0); [L1195-L1239] assume !(2 == ~m_run_pc~0); [L1203-L1238] assume !(3 == ~m_run_pc~0); [L1211-L1237] assume !(4 == ~m_run_pc~0); [L1219-L1236] assume !(5 == ~m_run_pc~0); [L1227-L1235] assume !(6 == ~m_run_pc~0); [L1241-L1258] assume !(2 == ~s_run_pc~0); [L1249-L1257] assume !(1 == ~s_run_pc~0); [L1260-L1349] assume !false; [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177-L1181] assume 1 == ~m_run_i~0; [L1178] ~m_run_st~0 := 0; [L1182-L1186] assume 1 == ~s_run_i~0; [L1183] ~s_run_st~0 := 0; [L1187-L1240] assume !(1 == ~m_run_pc~0); [L1195-L1239] assume !(2 == ~m_run_pc~0); [L1203-L1238] assume !(3 == ~m_run_pc~0); [L1211-L1237] assume !(4 == ~m_run_pc~0); [L1219-L1236] assume !(5 == ~m_run_pc~0); [L1227-L1235] assume !(6 == ~m_run_pc~0); [L1241-L1258] assume !(2 == ~s_run_pc~0); [L1249-L1257] assume !(1 == ~s_run_pc~0); [L1260-L1349] assume !false; [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [L1357] havoc ~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1173] havoc ~kernel_st~0; [L1176] ~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] ~kernel_st~0 := 1; [L1119] havoc ~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [L1357] havoc ~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1173] havoc ~kernel_st~0; [L1176] ~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] ~kernel_st~0 := 1; [L1119] havoc ~tmp~0; [L1120] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L21] int s_memory3 ; [L23] int s_run_st ; [L24] int s_run_i ; [L25] int s_run_pc ; [L26] int c_m_lock ; [L27] int c_m_ev ; [L28] int c_req_type ; [L29] int c_req_a ; [L30] int c_req_d ; [L31] int c_rsp_type ; [L32] int c_rsp_status ; [L33] int c_rsp_d ; [L34] int c_empty_req ; [L35] int c_empty_rsp ; [L36] int c_read_req_ev ; [L37] int c_write_req_ev ; [L38] int c_read_rsp_ev ; [L39] int c_write_rsp_ev ; [L40] static int d_t ; [L41] static int a_t ; [L42] static int req_t_type ; [L43] static int req_t_a ; [L44] static int req_t_d ; [L45] static int rsp_t_type ; [L46] static int rsp_t_status ; [L47] static int rsp_t_d ; [L48] static int req_tt_type ; [L49] static int req_tt_a ; [L50] static int req_tt_d ; [L51] static int rsp_tt_type ; [L52] static int rsp_tt_status ; [L53] static int rsp_tt_d ; [L850] static int req_t_type___0 ; [L851] static int req_t_a___0 ; [L852] static int req_t_d___0 ; [L853] static int rsp_t_type___0 ; [L854] static int rsp_t_status___0 ; [L855] static int rsp_t_d___0 ; [L1357] int __retres1 ; [L1361] c_m_lock = 0 [L1362] c_m_ev = 2 [L1364] m_run_i = 1 [L1365] m_run_pc = 0 [L1366] s_run_i = 1 [L1367] s_run_pc = 0 [L1368] c_empty_req = 1 [L1369] c_empty_rsp = 1 [L1370] c_read_req_ev = 2 [L1371] c_write_req_ev = 2 [L1372] c_read_rsp_ev = 2 [L1373] c_write_rsp_ev = 2 [L1374] c_m_lock = 0 [L1375] c_m_ev = 2 [L1173] int kernel_st ; [L1176] kernel_st = 0 [L1177] COND TRUE (int )m_run_i == 1 [L1178] m_run_st = 0 [L1182] COND TRUE (int )s_run_i == 1 [L1183] s_run_st = 0 [L1187] COND FALSE !((int )m_run_pc == 1) [L1195] COND FALSE !((int )m_run_pc == 2) [L1203] COND FALSE !((int )m_run_pc == 3) [L1211] COND FALSE !((int )m_run_pc == 4) [L1219] COND FALSE !((int )m_run_pc == 5) [L1227] COND FALSE !((int )m_run_pc == 6) [L1241] COND FALSE !((int )s_run_pc == 2) [L1249] COND FALSE !((int )s_run_pc == 1) [L1260] COND TRUE 1 [L1263] kernel_st = 1 [L1119] int tmp ; [L1120] 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); [L1124-L1165] assume !false; [L1126-L1134] assume 0 == ~m_run_st~0; [L1135-L1149] assume 0 == ~m_run_st~0; [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] assume !(0 != eval_~tmp~0); [L1150-L1164] assume 0 == ~s_run_st~0; [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1124-L1165] assume !false; [L1126-L1134] assume 0 == ~m_run_st~0; [L1135-L1149] assume 0 == ~m_run_st~0; [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] assume !(0 != eval_~tmp~0); [L1150-L1164] assume 0 == ~s_run_st~0; [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] assume !(0 != eval_~tmp___0~0); [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] COND FALSE !(0 != eval_~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] COND FALSE !(0 != eval_~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] COND FALSE !(0 != eval_~tmp___0~0) [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] ~tmp~0 := #t~nondet1; [L1137] havoc #t~nondet1; [L1139-L1146] COND FALSE !(0 != ~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] ~tmp___0~0 := #t~nondet2; [L1152] havoc #t~nondet2; [L1154-L1161] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] ~tmp~0 := #t~nondet1; [L1137] havoc #t~nondet1; [L1139-L1146] COND FALSE !(0 != ~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] ~tmp___0~0 := #t~nondet2; [L1152] havoc #t~nondet2; [L1154-L1161] COND FALSE !(0 != ~tmp___0~0) [L1124] COND TRUE 1 [L1126] COND TRUE (int )m_run_st == 0 [L1135] COND TRUE (int )m_run_st == 0 [L1137] tmp = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp)) [L1150] COND TRUE (int )s_run_st == 0 [L1152] tmp___0 = __VERIFIER_nondet_int() [L1154] COND FALSE !(\read(tmp___0)) ----- [2018-11-23 03:41:25,790 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_31d677ac-c697-45da-b143-481764c0806a/bin-2019/uautomizer/witness.graphml [2018-11-23 03:41:25,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:41:25,791 INFO L168 Benchmark]: Toolchain (without parser) took 4771.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.5 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -254.1 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:41:25,791 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:41:25,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.42 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 932.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 03:41:25,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 932.3 MB in the beginning and 1.2 GB in the end (delta: -225.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:41:25,792 INFO L168 Benchmark]: Boogie Preprocessor took 27.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:41:25,792 INFO L168 Benchmark]: RCFGBuilder took 816.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 85.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:41:25,793 INFO L168 Benchmark]: BuchiAutomizer took 3462.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -155.0 MB). Peak memory consumption was 342.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:41:25,793 INFO L168 Benchmark]: Witness Printer took 87.32 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:41:25,795 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.42 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 932.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 79.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 932.3 MB in the beginning and 1.2 GB in the end (delta: -225.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 816.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 85.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3462.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -155.0 MB). Peak memory consumption was 342.4 MB. Max. memory is 11.5 GB. * Witness Printer took 87.32 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 1106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s 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, 216 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1106 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2463 SDtfs, 1876 SDslu, 1014 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 lsp31 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf97 smp100 dnf180 smp81 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 20ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 1124]: 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, a_t=0, rsp_t_status=0, tmp=0, kernel_st=1, rsp_tt_status=0, req_t_type___0=0, tmp___0=0, c_m_ev=2, c_empty_rsp=1, s_memory1=0, s_memory3=0, req_t_d___0=0, c_req_d=0, req_t_a=0, rsp_t_type=0, req_t_a___0=0, d_t=0, rsp_t_d=0, c_write_rsp_ev=2, c_rsp_status=0, rsp_tt_type=0, rsp_tt_d=0, __retres1=0, rsp_t_d___0=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, c_empty_req=1, c_read_rsp_ev=2, m_run_i=1, rsp_t_status___0=0, s_memory2=0, req_t_d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a44d333=0, c_read_req_ev=2, c_req_a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b662042=0, c_req_type=0, s_memory0=0, req_t_type=0, req_tt_type=0, rsp_t_type___0=0, m_run_pc=0, s_run_pc=0, c_rsp_type=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1124]: 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_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177-L1181] assume 1 == ~m_run_i~0; [L1178] ~m_run_st~0 := 0; [L1182-L1186] assume 1 == ~s_run_i~0; [L1183] ~s_run_st~0 := 0; [L1187-L1240] assume !(1 == ~m_run_pc~0); [L1195-L1239] assume !(2 == ~m_run_pc~0); [L1203-L1238] assume !(3 == ~m_run_pc~0); [L1211-L1237] assume !(4 == ~m_run_pc~0); [L1219-L1236] assume !(5 == ~m_run_pc~0); [L1227-L1235] assume !(6 == ~m_run_pc~0); [L1241-L1258] assume !(2 == ~s_run_pc~0); [L1249-L1257] assume !(1 == ~s_run_pc~0); [L1260-L1349] assume !false; [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177-L1181] assume 1 == ~m_run_i~0; [L1178] ~m_run_st~0 := 0; [L1182-L1186] assume 1 == ~s_run_i~0; [L1183] ~s_run_st~0 := 0; [L1187-L1240] assume !(1 == ~m_run_pc~0); [L1195-L1239] assume !(2 == ~m_run_pc~0); [L1203-L1238] assume !(3 == ~m_run_pc~0); [L1211-L1237] assume !(4 == ~m_run_pc~0); [L1219-L1236] assume !(5 == ~m_run_pc~0); [L1227-L1235] assume !(6 == ~m_run_pc~0); [L1241-L1258] assume !(2 == ~s_run_pc~0); [L1249-L1257] assume !(1 == ~s_run_pc~0); [L1260-L1349] assume !false; [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [L1357] havoc ~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1173] havoc ~kernel_st~0; [L1176] ~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] ~kernel_st~0 := 1; [L1119] havoc ~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [L1357] havoc ~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1173] havoc ~kernel_st~0; [L1176] ~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] ~kernel_st~0 := 1; [L1119] havoc ~tmp~0; [L1120] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L21] int s_memory3 ; [L23] int s_run_st ; [L24] int s_run_i ; [L25] int s_run_pc ; [L26] int c_m_lock ; [L27] int c_m_ev ; [L28] int c_req_type ; [L29] int c_req_a ; [L30] int c_req_d ; [L31] int c_rsp_type ; [L32] int c_rsp_status ; [L33] int c_rsp_d ; [L34] int c_empty_req ; [L35] int c_empty_rsp ; [L36] int c_read_req_ev ; [L37] int c_write_req_ev ; [L38] int c_read_rsp_ev ; [L39] int c_write_rsp_ev ; [L40] static int d_t ; [L41] static int a_t ; [L42] static int req_t_type ; [L43] static int req_t_a ; [L44] static int req_t_d ; [L45] static int rsp_t_type ; [L46] static int rsp_t_status ; [L47] static int rsp_t_d ; [L48] static int req_tt_type ; [L49] static int req_tt_a ; [L50] static int req_tt_d ; [L51] static int rsp_tt_type ; [L52] static int rsp_tt_status ; [L53] static int rsp_tt_d ; [L850] static int req_t_type___0 ; [L851] static int req_t_a___0 ; [L852] static int req_t_d___0 ; [L853] static int rsp_t_type___0 ; [L854] static int rsp_t_status___0 ; [L855] static int rsp_t_d___0 ; [L1357] int __retres1 ; [L1361] c_m_lock = 0 [L1362] c_m_ev = 2 [L1364] m_run_i = 1 [L1365] m_run_pc = 0 [L1366] s_run_i = 1 [L1367] s_run_pc = 0 [L1368] c_empty_req = 1 [L1369] c_empty_rsp = 1 [L1370] c_read_req_ev = 2 [L1371] c_write_req_ev = 2 [L1372] c_read_rsp_ev = 2 [L1373] c_write_rsp_ev = 2 [L1374] c_m_lock = 0 [L1375] c_m_ev = 2 [L1173] int kernel_st ; [L1176] kernel_st = 0 [L1177] COND TRUE (int )m_run_i == 1 [L1178] m_run_st = 0 [L1182] COND TRUE (int )s_run_i == 1 [L1183] s_run_st = 0 [L1187] COND FALSE !((int )m_run_pc == 1) [L1195] COND FALSE !((int )m_run_pc == 2) [L1203] COND FALSE !((int )m_run_pc == 3) [L1211] COND FALSE !((int )m_run_pc == 4) [L1219] COND FALSE !((int )m_run_pc == 5) [L1227] COND FALSE !((int )m_run_pc == 6) [L1241] COND FALSE !((int )s_run_pc == 2) [L1249] COND FALSE !((int )s_run_pc == 1) [L1260] COND TRUE 1 [L1263] kernel_st = 1 [L1119] int tmp ; [L1120] 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); [L1124-L1165] assume !false; [L1126-L1134] assume 0 == ~m_run_st~0; [L1135-L1149] assume 0 == ~m_run_st~0; [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] assume !(0 != eval_~tmp~0); [L1150-L1164] assume 0 == ~s_run_st~0; [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1124-L1165] assume !false; [L1126-L1134] assume 0 == ~m_run_st~0; [L1135-L1149] assume 0 == ~m_run_st~0; [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] assume !(0 != eval_~tmp~0); [L1150-L1164] assume 0 == ~s_run_st~0; [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] assume !(0 != eval_~tmp___0~0); [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] COND FALSE !(0 != eval_~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] COND FALSE !(0 != eval_~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] COND FALSE !(0 != eval_~tmp___0~0) [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] ~tmp~0 := #t~nondet1; [L1137] havoc #t~nondet1; [L1139-L1146] COND FALSE !(0 != ~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] ~tmp___0~0 := #t~nondet2; [L1152] havoc #t~nondet2; [L1154-L1161] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] ~tmp~0 := #t~nondet1; [L1137] havoc #t~nondet1; [L1139-L1146] COND FALSE !(0 != ~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] ~tmp___0~0 := #t~nondet2; [L1152] havoc #t~nondet2; [L1154-L1161] COND FALSE !(0 != ~tmp___0~0) [L1124] COND TRUE 1 [L1126] COND TRUE (int )m_run_st == 0 [L1135] COND TRUE (int )m_run_st == 0 [L1137] tmp = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp)) [L1150] COND TRUE (int )s_run_st == 0 [L1152] tmp___0 = __VERIFIER_nondet_int() [L1154] 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_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177-L1181] assume 1 == ~m_run_i~0; [L1178] ~m_run_st~0 := 0; [L1182-L1186] assume 1 == ~s_run_i~0; [L1183] ~s_run_st~0 := 0; [L1187-L1240] assume !(1 == ~m_run_pc~0); [L1195-L1239] assume !(2 == ~m_run_pc~0); [L1203-L1238] assume !(3 == ~m_run_pc~0); [L1211-L1237] assume !(4 == ~m_run_pc~0); [L1219-L1236] assume !(5 == ~m_run_pc~0); [L1227-L1235] assume !(6 == ~m_run_pc~0); [L1241-L1258] assume !(2 == ~s_run_pc~0); [L1249-L1257] assume !(1 == ~s_run_pc~0); [L1260-L1349] assume !false; [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177-L1181] assume 1 == ~m_run_i~0; [L1178] ~m_run_st~0 := 0; [L1182-L1186] assume 1 == ~s_run_i~0; [L1183] ~s_run_st~0 := 0; [L1187-L1240] assume !(1 == ~m_run_pc~0); [L1195-L1239] assume !(2 == ~m_run_pc~0); [L1203-L1238] assume !(3 == ~m_run_pc~0); [L1211-L1237] assume !(4 == ~m_run_pc~0); [L1219-L1236] assume !(5 == ~m_run_pc~0); [L1227-L1235] assume !(6 == ~m_run_pc~0); [L1241-L1258] assume !(2 == ~s_run_pc~0); [L1249-L1257] assume !(1 == ~s_run_pc~0); [L1260-L1349] assume !false; [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1357] havoc main_~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1376] havoc start_simulation_~kernel_st~0; [L1173] havoc start_simulation_~kernel_st~0; [L1176] start_simulation_~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] start_simulation_~kernel_st~0 := 1; [L1264] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1119] havoc eval_~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [L1357] havoc ~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1173] havoc ~kernel_st~0; [L1176] ~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] ~kernel_st~0 := 1; [L1119] havoc ~tmp~0; [L1120] 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; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L21] ~s_memory3~0 := 0; [L23] ~s_run_st~0 := 0; [L24] ~s_run_i~0 := 0; [L25] ~s_run_pc~0 := 0; [L26] ~c_m_lock~0 := 0; [L27] ~c_m_ev~0 := 0; [L28] ~c_req_type~0 := 0; [L29] ~c_req_a~0 := 0; [L30] ~c_req_d~0 := 0; [L31] ~c_rsp_type~0 := 0; [L32] ~c_rsp_status~0 := 0; [L33] ~c_rsp_d~0 := 0; [L34] ~c_empty_req~0 := 0; [L35] ~c_empty_rsp~0 := 0; [L36] ~c_read_req_ev~0 := 0; [L37] ~c_write_req_ev~0 := 0; [L38] ~c_read_rsp_ev~0 := 0; [L39] ~c_write_rsp_ev~0 := 0; [L40] ~d_t~0 := 0; [L41] ~a_t~0 := 0; [L42] ~req_t_type~0 := 0; [L43] ~req_t_a~0 := 0; [L44] ~req_t_d~0 := 0; [L45] ~rsp_t_type~0 := 0; [L46] ~rsp_t_status~0 := 0; [L47] ~rsp_t_d~0 := 0; [L48] ~req_tt_type~0 := 0; [L49] ~req_tt_a~0 := 0; [L50] ~req_tt_d~0 := 0; [L51] ~rsp_tt_type~0 := 0; [L52] ~rsp_tt_status~0 := 0; [L53] ~rsp_tt_d~0 := 0; [L850] ~req_t_type___0~0 := 0; [L851] ~req_t_a___0~0 := 0; [L852] ~req_t_d___0~0 := 0; [L853] ~rsp_t_type___0~0 := 0; [L854] ~rsp_t_status___0~0 := 0; [L855] ~rsp_t_d___0~0 := 0; [L1357] havoc ~__retres1~0; [L1361] ~c_m_lock~0 := 0; [L1362] ~c_m_ev~0 := 2; [L1364] ~m_run_i~0 := 1; [L1365] ~m_run_pc~0 := 0; [L1366] ~s_run_i~0 := 1; [L1367] ~s_run_pc~0 := 0; [L1368] ~c_empty_req~0 := 1; [L1369] ~c_empty_rsp~0 := 1; [L1370] ~c_read_req_ev~0 := 2; [L1371] ~c_write_req_ev~0 := 2; [L1372] ~c_read_rsp_ev~0 := 2; [L1373] ~c_write_rsp_ev~0 := 2; [L1374] ~c_m_lock~0 := 0; [L1375] ~c_m_ev~0 := 2; [L1173] havoc ~kernel_st~0; [L1176] ~kernel_st~0 := 0; [L1177] COND TRUE 1 == ~m_run_i~0 [L1178] ~m_run_st~0 := 0; [L1182] COND TRUE 1 == ~s_run_i~0 [L1183] ~s_run_st~0 := 0; [L1187] COND FALSE !(1 == ~m_run_pc~0) [L1195] COND FALSE !(2 == ~m_run_pc~0) [L1203] COND FALSE !(3 == ~m_run_pc~0) [L1211] COND FALSE !(4 == ~m_run_pc~0) [L1219] COND FALSE !(5 == ~m_run_pc~0) [L1227] COND FALSE !(6 == ~m_run_pc~0) [L1241] COND FALSE !(2 == ~s_run_pc~0) [L1249] COND FALSE !(1 == ~s_run_pc~0) [L1260-L1349] COND FALSE !(false) [L1263] ~kernel_st~0 := 1; [L1119] havoc ~tmp~0; [L1120] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L21] int s_memory3 ; [L23] int s_run_st ; [L24] int s_run_i ; [L25] int s_run_pc ; [L26] int c_m_lock ; [L27] int c_m_ev ; [L28] int c_req_type ; [L29] int c_req_a ; [L30] int c_req_d ; [L31] int c_rsp_type ; [L32] int c_rsp_status ; [L33] int c_rsp_d ; [L34] int c_empty_req ; [L35] int c_empty_rsp ; [L36] int c_read_req_ev ; [L37] int c_write_req_ev ; [L38] int c_read_rsp_ev ; [L39] int c_write_rsp_ev ; [L40] static int d_t ; [L41] static int a_t ; [L42] static int req_t_type ; [L43] static int req_t_a ; [L44] static int req_t_d ; [L45] static int rsp_t_type ; [L46] static int rsp_t_status ; [L47] static int rsp_t_d ; [L48] static int req_tt_type ; [L49] static int req_tt_a ; [L50] static int req_tt_d ; [L51] static int rsp_tt_type ; [L52] static int rsp_tt_status ; [L53] static int rsp_tt_d ; [L850] static int req_t_type___0 ; [L851] static int req_t_a___0 ; [L852] static int req_t_d___0 ; [L853] static int rsp_t_type___0 ; [L854] static int rsp_t_status___0 ; [L855] static int rsp_t_d___0 ; [L1357] int __retres1 ; [L1361] c_m_lock = 0 [L1362] c_m_ev = 2 [L1364] m_run_i = 1 [L1365] m_run_pc = 0 [L1366] s_run_i = 1 [L1367] s_run_pc = 0 [L1368] c_empty_req = 1 [L1369] c_empty_rsp = 1 [L1370] c_read_req_ev = 2 [L1371] c_write_req_ev = 2 [L1372] c_read_rsp_ev = 2 [L1373] c_write_rsp_ev = 2 [L1374] c_m_lock = 0 [L1375] c_m_ev = 2 [L1173] int kernel_st ; [L1176] kernel_st = 0 [L1177] COND TRUE (int )m_run_i == 1 [L1178] m_run_st = 0 [L1182] COND TRUE (int )s_run_i == 1 [L1183] s_run_st = 0 [L1187] COND FALSE !((int )m_run_pc == 1) [L1195] COND FALSE !((int )m_run_pc == 2) [L1203] COND FALSE !((int )m_run_pc == 3) [L1211] COND FALSE !((int )m_run_pc == 4) [L1219] COND FALSE !((int )m_run_pc == 5) [L1227] COND FALSE !((int )m_run_pc == 6) [L1241] COND FALSE !((int )s_run_pc == 2) [L1249] COND FALSE !((int )s_run_pc == 1) [L1260] COND TRUE 1 [L1263] kernel_st = 1 [L1119] int tmp ; [L1120] 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); [L1124-L1165] assume !false; [L1126-L1134] assume 0 == ~m_run_st~0; [L1135-L1149] assume 0 == ~m_run_st~0; [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] assume !(0 != eval_~tmp~0); [L1150-L1164] assume 0 == ~s_run_st~0; [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1124-L1165] assume !false; [L1126-L1134] assume 0 == ~m_run_st~0; [L1135-L1149] assume 0 == ~m_run_st~0; [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] assume !(0 != eval_~tmp~0); [L1150-L1164] assume 0 == ~s_run_st~0; [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] assume !(0 != eval_~tmp___0~0); [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] COND FALSE !(0 != eval_~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] eval_~tmp~0 := eval_#t~nondet1; [L1137] havoc eval_#t~nondet1; [L1139-L1146] COND FALSE !(0 != eval_~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] eval_~tmp___0~0 := eval_#t~nondet2; [L1152] havoc eval_#t~nondet2; [L1154-L1161] COND FALSE !(0 != eval_~tmp___0~0) [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] ~tmp~0 := #t~nondet1; [L1137] havoc #t~nondet1; [L1139-L1146] COND FALSE !(0 != ~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] ~tmp___0~0 := #t~nondet2; [L1152] havoc #t~nondet2; [L1154-L1161] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1124-L1165] COND FALSE !(false) [L1126] COND TRUE 0 == ~m_run_st~0 [L1135] COND TRUE 0 == ~m_run_st~0 [L1137] ~tmp~0 := #t~nondet1; [L1137] havoc #t~nondet1; [L1139-L1146] COND FALSE !(0 != ~tmp~0) [L1150] COND TRUE 0 == ~s_run_st~0 [L1152] ~tmp___0~0 := #t~nondet2; [L1152] havoc #t~nondet2; [L1154-L1161] COND FALSE !(0 != ~tmp___0~0) [L1124] COND TRUE 1 [L1126] COND TRUE (int )m_run_st == 0 [L1135] COND TRUE (int )m_run_st == 0 [L1137] tmp = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp)) [L1150] COND TRUE (int )s_run_st == 0 [L1152] tmp___0 = __VERIFIER_nondet_int() [L1154] 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 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L21] int s_memory3 ; [L23] int s_run_st ; [L24] int s_run_i ; [L25] int s_run_pc ; [L26] int c_m_lock ; [L27] int c_m_ev ; [L28] int c_req_type ; [L29] int c_req_a ; [L30] int c_req_d ; [L31] int c_rsp_type ; [L32] int c_rsp_status ; [L33] int c_rsp_d ; [L34] int c_empty_req ; [L35] int c_empty_rsp ; [L36] int c_read_req_ev ; [L37] int c_write_req_ev ; [L38] int c_read_rsp_ev ; [L39] int c_write_rsp_ev ; [L40] static int d_t ; [L41] static int a_t ; [L42] static int req_t_type ; [L43] static int req_t_a ; [L44] static int req_t_d ; [L45] static int rsp_t_type ; [L46] static int rsp_t_status ; [L47] static int rsp_t_d ; [L48] static int req_tt_type ; [L49] static int req_tt_a ; [L50] static int req_tt_d ; [L51] static int rsp_tt_type ; [L52] static int rsp_tt_status ; [L53] static int rsp_tt_d ; [L850] static int req_t_type___0 ; [L851] static int req_t_a___0 ; [L852] static int req_t_d___0 ; [L853] static int rsp_t_type___0 ; [L854] static int rsp_t_status___0 ; [L855] static int rsp_t_d___0 ; [L1357] int __retres1 ; [L1361] c_m_lock = 0 [L1362] c_m_ev = 2 [L1364] m_run_i = 1 [L1365] m_run_pc = 0 [L1366] s_run_i = 1 [L1367] s_run_pc = 0 [L1368] c_empty_req = 1 [L1369] c_empty_rsp = 1 [L1370] c_read_req_ev = 2 [L1371] c_write_req_ev = 2 [L1372] c_read_rsp_ev = 2 [L1373] c_write_rsp_ev = 2 [L1374] c_m_lock = 0 [L1375] c_m_ev = 2 [L1173] int kernel_st ; [L1176] kernel_st = 0 [L1177] COND TRUE (int )m_run_i == 1 [L1178] m_run_st = 0 [L1182] COND TRUE (int )s_run_i == 1 [L1183] s_run_st = 0 [L1187] COND FALSE !((int )m_run_pc == 1) [L1195] COND FALSE !((int )m_run_pc == 2) [L1203] COND FALSE !((int )m_run_pc == 3) [L1211] COND FALSE !((int )m_run_pc == 4) [L1219] COND FALSE !((int )m_run_pc == 5) [L1227] COND FALSE !((int )m_run_pc == 6) [L1241] COND FALSE !((int )s_run_pc == 2) [L1249] COND FALSE !((int )s_run_pc == 1) [L1260] COND TRUE 1 [L1263] kernel_st = 1 [L1119] int tmp ; [L1120] int tmp___0 ; Loop: [L1124] COND TRUE 1 [L1126] COND TRUE (int )m_run_st == 0 [L1135] COND TRUE (int )m_run_st == 0 [L1137] tmp = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp)) [L1150] COND TRUE (int )s_run_st == 0 [L1152] tmp___0 = __VERIFIER_nondet_int() [L1154] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...