./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.5_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_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.5_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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 fc56d830892b5abb189f6806b677ccd05f5e9c9a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-22 23:28:19,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:28:19,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:28:19,298 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:28:19,298 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:28:19,299 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:28:19,300 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:28:19,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:28:19,302 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:28:19,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:28:19,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:28:19,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:28:19,304 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:28:19,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:28:19,306 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:28:19,306 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:28:19,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:28:19,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:28:19,309 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:28:19,310 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:28:19,310 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:28:19,311 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:28:19,313 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:28:19,313 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:28:19,313 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:28:19,314 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:28:19,315 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:28:19,316 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:28:19,316 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:28:19,317 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:28:19,317 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:28:19,318 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:28:19,318 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:28:19,318 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:28:19,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:28:19,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:28:19,319 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 23:28:19,331 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:28:19,331 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:28:19,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:28:19,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:28:19,332 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:28:19,332 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:28:19,333 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:28:19,333 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:28:19,333 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:28:19,333 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:28:19,333 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:28:19,333 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:28:19,333 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:28:19,334 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:28:19,334 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:28:19,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:28:19,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:28:19,334 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:28:19,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:28:19,334 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:28:19,334 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:28:19,335 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:28:19,335 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:28:19,335 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:28:19,335 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:28:19,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:28:19,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:28:19,335 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:28:19,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:28:19,336 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:28:19,338 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:28:19,339 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:28:19,339 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_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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 -> fc56d830892b5abb189f6806b677ccd05f5e9c9a [2018-11-22 23:28:19,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:28:19,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:28:19,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:28:19,374 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:28:19,374 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:28:19,375 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.5_true-unreach-call_false-termination.cil.c [2018-11-22 23:28:19,414 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/data/105a2e9ef/a630305c10e043df9f898db09fc4aee8/FLAGc75a808bd [2018-11-22 23:28:19,839 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:28:19,839 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/sv-benchmarks/c/systemc/mem_slave_tlm.5_true-unreach-call_false-termination.cil.c [2018-11-22 23:28:19,848 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/data/105a2e9ef/a630305c10e043df9f898db09fc4aee8/FLAGc75a808bd [2018-11-22 23:28:19,859 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/data/105a2e9ef/a630305c10e043df9f898db09fc4aee8 [2018-11-22 23:28:19,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:28:19,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:28:19,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:28:19,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:28:19,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:28:19,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:28:19" (1/1) ... [2018-11-22 23:28:19,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed7bee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:19, skipping insertion in model container [2018-11-22 23:28:19,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:28:19" (1/1) ... [2018-11-22 23:28:19,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:28:19,913 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:28:20,086 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:28:20,089 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:28:20,138 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:28:20,149 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:28:20,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20 WrapperNode [2018-11-22 23:28:20,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:28:20,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:28:20,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:28:20,150 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:28:20,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... [2018-11-22 23:28:20,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... [2018-11-22 23:28:20,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:28:20,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:28:20,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:28:20,234 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:28:20,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... [2018-11-22 23:28:20,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... [2018-11-22 23:28:20,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... [2018-11-22 23:28:20,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... [2018-11-22 23:28:20,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... [2018-11-22 23:28:20,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... [2018-11-22 23:28:20,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... [2018-11-22 23:28:20,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:28:20,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:28:20,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:28:20,269 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:28:20,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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-22 23:28:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:28:20,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:28:21,031 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:28:21,031 INFO L280 CfgBuilder]: Removed 39 assue(true) statements. [2018-11-22 23:28:21,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:28:21 BoogieIcfgContainer [2018-11-22 23:28:21,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:28:21,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:28:21,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:28:21,035 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:28:21,035 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:28:21,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:28:19" (1/3) ... [2018-11-22 23:28:21,036 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68a2b3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:28:21, skipping insertion in model container [2018-11-22 23:28:21,037 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:28:21,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:28:20" (2/3) ... [2018-11-22 23:28:21,037 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68a2b3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:28:21, skipping insertion in model container [2018-11-22 23:28:21,037 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:28:21,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:28:21" (3/3) ... [2018-11-22 23:28:21,038 INFO L375 chiAutomizerObserver]: Analyzing ICFG mem_slave_tlm.5_true-unreach-call_false-termination.cil.c [2018-11-22 23:28:21,070 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:28:21,070 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:28:21,070 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:28:21,070 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:28:21,070 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:28:21,071 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:28:21,071 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:28:21,071 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:28:21,071 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:28:21,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states. [2018-11-22 23:28:21,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 249 [2018-11-22 23:28:21,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:28:21,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:28:21,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:21,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:21,112 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:28:21,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states. [2018-11-22 23:28:21,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 249 [2018-11-22 23:28:21,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:28:21,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:28:21,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:21,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:21,123 INFO L794 eck$LassoCheckResult]: Stem: 102#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_memory4~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; 13#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; 212#L1181true assume !(1 == ~m_run_i~0);~m_run_st~0 := 2; 217#L1181-2true assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 243#L1186-1true assume 1 == ~m_run_pc~0; 213#L1192true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 75#L1231true assume !(2 == ~s_run_pc~0); 240#L1252true assume !(1 == ~s_run_pc~0); 47#L1347-1true [2018-11-22 23:28:21,123 INFO L796 eck$LassoCheckResult]: Loop: 47#L1347-1true assume !false; 19#L1265true 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; 65#L1154true assume !true; 214#L1170true start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 79#L1272true assume 1 == ~m_run_pc~0; 147#L1273true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 138#L1312true assume 2 == ~s_run_pc~0; 92#L1327true assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 137#L1334true assume 0 == ~m_run_st~0; 47#L1347-1true [2018-11-22 23:28:21,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 180491512, now seen corresponding path program 1 times [2018-11-22 23:28:21,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:21,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:21,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:21,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:21,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:28:21,242 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-22 23:28:21,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:28:21,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:28:21,247 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:28:21,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2127664435, now seen corresponding path program 1 times [2018-11-22 23:28:21,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:21,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:21,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:21,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:21,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:28:21,252 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-22 23:28:21,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:28:21,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:28:21,254 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:28:21,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:28:21,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:28:21,265 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 3 states. [2018-11-22 23:28:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:28:21,299 INFO L93 Difference]: Finished difference Result 273 states and 471 transitions. [2018-11-22 23:28:21,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:28:21,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 471 transitions. [2018-11-22 23:28:21,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 244 [2018-11-22 23:28:21,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 264 states and 462 transitions. [2018-11-22 23:28:21,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2018-11-22 23:28:21,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2018-11-22 23:28:21,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 462 transitions. [2018-11-22 23:28:21,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:28:21,312 INFO L705 BuchiCegarLoop]: Abstraction has 264 states and 462 transitions. [2018-11-22 23:28:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 462 transitions. [2018-11-22 23:28:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-11-22 23:28:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-22 23:28:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 462 transitions. [2018-11-22 23:28:21,344 INFO L728 BuchiCegarLoop]: Abstraction has 264 states and 462 transitions. [2018-11-22 23:28:21,344 INFO L608 BuchiCegarLoop]: Abstraction has 264 states and 462 transitions. [2018-11-22 23:28:21,345 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:28:21,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 462 transitions. [2018-11-22 23:28:21,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 244 [2018-11-22 23:28:21,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:28:21,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:28:21,347 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:21,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:21,347 INFO L794 eck$LassoCheckResult]: Stem: 737#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_memory4~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; 580#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; 581#L1181 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 814#L1181-2 assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 816#L1186-1 assume 1 == ~m_run_pc~0; 815#L1192 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 601#L1231 assume !(2 == ~s_run_pc~0); 705#L1252 assume !(1 == ~s_run_pc~0); 596#L1347-1 [2018-11-22 23:28:21,348 INFO L796 eck$LassoCheckResult]: Loop: 596#L1347-1 assume !false; 593#L1265 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; 594#L1154 assume !false; 689#L1129 assume !(0 == ~m_run_st~0); 557#L1133 assume !(0 == ~s_run_st~0); 559#L1170 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 708#L1272 assume 1 == ~m_run_pc~0; 710#L1273 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 658#L1312 assume 2 == ~s_run_pc~0; 727#L1327 assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 728#L1334 assume 0 == ~m_run_st~0; 596#L1347-1 [2018-11-22 23:28:21,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:21,348 INFO L82 PathProgramCache]: Analyzing trace with hash 123233210, now seen corresponding path program 1 times [2018-11-22 23:28:21,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:21,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:21,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:28:21,370 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-22 23:28:21,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:28:21,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:28:21,370 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:28:21,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash -760181728, now seen corresponding path program 1 times [2018-11-22 23:28:21,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:21,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:21,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:21,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:21,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:21,445 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:28:21,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:28:21,446 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:28:21,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:28:21,446 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 23:28:21,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:28:21,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:28:21,446 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:28:21,446 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.5_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-22 23:28:21,447 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:28:21,447 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:28:21,461 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-22 23:28:21,468 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-22 23:28:21,469 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-22 23:28:21,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:28:21,477 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-22 23:28:21,479 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-22 23:28:21,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:28:21,482 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-22 23:28:21,484 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-22 23:28:21,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:28:21,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:28:21,595 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:28:21,596 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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-22 23:28:21,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:28:21,600 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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-22 23:28:21,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 23:28:21,623 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:28:21,643 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 23:28:21,644 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:28:21,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:28:21,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:28:21,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:28:21,644 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:28:21,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:28:21,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:28:21,644 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:28:21,644 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.5_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-22 23:28:21,644 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:28:21,644 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:28:21,645 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-22 23:28:21,651 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-22 23:28:21,652 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-22 23:28:21,655 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-22 23:28:21,660 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-22 23:28:21,662 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-22 23:28:21,664 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-22 23:28:21,666 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-22 23:28:21,667 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-22 23:28:21,668 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-22 23:28:21,669 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-22 23:28:21,749 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:28:21,753 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:28:21,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,756 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,758 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:21,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:21,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,774 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,775 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:21,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:21,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:21,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:21,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:21,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:21,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:21,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:21,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,803 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-22 23:28:21,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,805 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,805 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:21,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,812 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,813 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,815 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,815 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,819 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,819 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:21,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,828 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,831 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,832 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,837 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,838 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,841 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,843 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,845 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,846 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,849 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,849 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,851 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,852 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,853 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-22 23:28:21,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,854 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,854 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,855 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:21,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,864 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,867 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,867 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,873 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,874 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:21,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,881 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,889 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,894 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,896 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,897 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,901 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:21,903 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:21,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,904 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-22 23:28:21,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,905 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,905 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,906 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:28:21,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,912 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,913 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:21,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,915 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,916 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:21,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,919 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,919 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,920 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:28:21,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,927 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,927 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:21,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,931 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,932 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:21,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,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-22 23:28:21,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,935 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,936 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:21,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,940 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:21,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,943 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,943 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:21,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,947 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:21,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:21,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,950 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:21,950 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:21,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,951 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-22 23:28:21,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,952 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:21,952 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:21,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,953 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,953 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:21,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,964 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:21,964 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:21,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,964 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,965 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:21,967 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:21,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,967 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,968 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:21,973 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:21,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,974 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:21,974 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:21,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,982 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:21,982 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:21,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,983 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,983 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:21,987 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:21,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,988 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,988 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:21,992 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:21,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,993 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,993 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:21,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:21,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:21,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:21,998 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:21,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:21,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:21,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:21,998 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:21,999 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:21,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,001 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,002 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,002 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,006 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,007 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,008 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,010 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,010 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,011 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,012 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-22 23:28:22,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,013 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,013 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,013 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,015 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:22,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,026 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,027 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,028 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,030 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,031 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,036 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,036 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,037 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:22,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,046 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,047 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,052 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,052 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,053 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,057 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,057 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,058 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,063 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,063 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,064 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,066 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,071 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,071 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,072 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,072 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,074 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:22,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,075 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,075 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,077 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-22 23:28:22,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-22 23:28:22,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,078 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,078 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,078 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,080 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:28:22,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,093 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,094 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,096 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,097 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,098 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,105 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,105 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,105 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,108 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:28:22,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,121 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,121 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,122 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,123 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,131 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,137 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,137 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,137 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,139 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,146 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,146 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,146 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,147 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,149 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,150 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,151 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,156 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,157 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,158 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,160 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,160 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,160 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,161 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,163 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-22 23:28:22,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-22 23:28:22,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,163 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,164 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,164 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,165 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:22,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,171 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,172 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,172 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,175 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,175 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,179 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,179 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,180 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:22,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,186 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,186 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,187 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,187 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,191 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,194 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,195 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,200 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,200 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,201 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,201 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,204 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,204 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,205 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,208 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,209 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,209 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,211 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,212 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,212 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,212 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,214 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-22 23:28:22,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,215 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,216 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,216 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,217 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:28:22,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,278 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,278 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,279 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,283 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,283 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,283 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,287 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,288 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,288 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,288 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,289 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:28:22,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,301 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,302 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,306 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,306 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,306 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,310 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,310 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,317 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,317 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,317 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,321 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,321 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,325 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,326 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,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-22 23:28:22,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,329 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:22,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,330 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:22,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:28:22,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:28:22,333 INFO L87 Difference]: Start difference. First operand 264 states and 462 transitions. cyclomatic complexity: 199 Second operand 3 states. [2018-11-22 23:28:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:28:22,355 INFO L93 Difference]: Finished difference Result 264 states and 461 transitions. [2018-11-22 23:28:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:28:22,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 461 transitions. [2018-11-22 23:28:22,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 244 [2018-11-22 23:28:22,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 264 states and 461 transitions. [2018-11-22 23:28:22,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2018-11-22 23:28:22,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2018-11-22 23:28:22,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 461 transitions. [2018-11-22 23:28:22,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:28:22,362 INFO L705 BuchiCegarLoop]: Abstraction has 264 states and 461 transitions. [2018-11-22 23:28:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 461 transitions. [2018-11-22 23:28:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-11-22 23:28:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-22 23:28:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 461 transitions. [2018-11-22 23:28:22,370 INFO L728 BuchiCegarLoop]: Abstraction has 264 states and 461 transitions. [2018-11-22 23:28:22,370 INFO L608 BuchiCegarLoop]: Abstraction has 264 states and 461 transitions. [2018-11-22 23:28:22,370 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 23:28:22,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 461 transitions. [2018-11-22 23:28:22,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 244 [2018-11-22 23:28:22,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:28:22,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:28:22,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:22,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:22,372 INFO L794 eck$LassoCheckResult]: Stem: 1271#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_memory4~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; 1114#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; 1115#L1181 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 1348#L1181-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 1350#L1186-1 assume 1 == ~m_run_pc~0; 1349#L1192 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1135#L1231 assume !(2 == ~s_run_pc~0); 1239#L1252 assume !(1 == ~s_run_pc~0); 1130#L1347-1 [2018-11-22 23:28:22,373 INFO L796 eck$LassoCheckResult]: Loop: 1130#L1347-1 assume !false; 1127#L1265 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; 1128#L1154 assume !false; 1223#L1129 assume !(0 == ~m_run_st~0); 1091#L1133 assume !(0 == ~s_run_st~0); 1093#L1170 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 1242#L1272 assume 1 == ~m_run_pc~0; 1244#L1273 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1192#L1312 assume 2 == ~s_run_pc~0; 1261#L1327 assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 1262#L1334 assume 0 == ~m_run_st~0; 1130#L1347-1 [2018-11-22 23:28:22,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash 121386168, now seen corresponding path program 1 times [2018-11-22 23:28:22,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:22,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:22,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:22,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:22,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:28:22,396 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-22 23:28:22,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:28:22,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:28:22,397 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:28:22,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash -760181728, now seen corresponding path program 2 times [2018-11-22 23:28:22,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:22,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:22,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:22,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:22,424 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:28:22,424 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:28:22,424 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:28:22,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:28:22,425 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 23:28:22,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:28:22,425 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:28:22,425 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:28:22,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.5_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-22 23:28:22,425 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:28:22,425 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:28:22,426 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-22 23:28:22,441 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-22 23:28:22,444 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-22 23:28:22,448 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-22 23:28:22,453 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-22 23:28:22,455 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-22 23:28:22,458 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-22 23:28:22,460 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-22 23:28:22,462 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-22 23:28:22,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:28:22,467 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-22 23:28:22,530 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:28:22,530 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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-22 23:28:22,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:28:22,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:28:22,554 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:28:22,554 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_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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-22 23:28:22,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:28:22,577 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:28:22,580 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:28:22,580 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_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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-22 23:28:22,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:28:22,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:28:22,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:28:22,608 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_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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) [2018-11-22 23:28:22,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:28:22,649 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:28:22,668 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:28:22,668 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_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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-22 23:28:22,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:28:22,697 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:28:22,716 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:28:22,716 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_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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-22 23:28:22,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:28:22,733 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/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-22 23:28:22,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 23:28:22,752 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:28:22,771 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 23:28:22,773 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:28:22,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:28:22,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:28:22,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:28:22,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:28:22,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:28:22,773 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:28:22,773 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:28:22,773 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.5_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-22 23:28:22,773 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:28:22,773 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:28:22,774 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-22 23:28:22,778 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-22 23:28:22,784 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-22 23:28:22,785 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-22 23:28:22,788 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-22 23:28:22,789 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-22 23:28:22,808 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-22 23:28:22,809 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-22 23:28:22,813 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-22 23:28:22,816 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-22 23:28:22,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:28:22,878 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:28:22,878 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:28:22,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:22,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:22,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:22,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:22,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:22,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,888 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:22,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:22,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,894 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,895 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:22,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:28:22,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:28:22,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,899 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-22 23:28:22,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,901 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,901 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,903 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,903 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,907 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,907 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,908 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,908 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,910 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,910 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,913 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,913 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,917 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,917 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,918 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,918 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,921 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,921 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:22,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,924 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,925 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,926 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,926 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,927 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-22 23:28:22,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,927 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,929 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,931 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,931 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,934 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,935 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,935 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,937 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,937 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,939 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,940 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:22,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,943 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,943 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,946 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,946 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:22,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,948 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,949 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,949 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:22,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,952 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,953 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:22,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,954 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:22,954 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:22,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,955 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-22 23:28:22,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,956 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,958 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:22,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,961 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,961 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,963 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,963 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:22,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,965 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,965 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:22,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,967 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,967 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,968 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:28:22,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,972 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:22,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,973 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,974 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,976 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:22,976 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,977 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:28:22,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:22,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,987 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:22,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:28:22,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,989 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:22,989 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:22,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:22,990 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-22 23:28: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-22 23:28:22,990 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,991 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,991 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,991 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:22,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,995 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,995 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:22,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:22,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:22,998 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:22,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:22,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:22,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:22,999 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:22,999 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:22,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,001 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,001 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:23,002 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:23,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,004 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,005 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:23,005 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:23,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,007 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,008 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,008 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:23,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,013 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,013 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:23,013 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:23,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,015 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,015 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:23,015 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:23,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,018 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,018 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,019 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:23,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,023 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,024 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:23,024 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:23,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,025 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,026 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:28:23,026 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:28:23,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,027 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-22 23:28:23,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,027 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,027 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,028 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,028 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,031 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,032 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,032 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,036 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,037 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,038 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,039 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,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-22 23:28:23,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,042 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,043 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,043 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,046 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,046 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,047 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:23,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,053 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,054 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,054 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,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-22 23:28:23,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,059 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,060 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,063 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,065 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,066 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:23,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,072 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,073 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,073 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,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-22 23:28:23,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,075 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:28:23,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,075 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,076 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,077 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-22 23:28: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-22 23:28:23,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,077 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,078 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,078 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:23,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,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-22 23:28:23,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,083 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,084 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,085 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:23,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,091 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,091 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,091 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,092 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:23,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,094 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,094 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,095 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:23,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,100 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,100 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,101 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,101 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:23,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,106 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,107 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,107 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,108 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:28:23,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,118 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,119 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,122 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:23,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,124 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,124 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,125 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:23,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,130 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,131 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,131 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,133 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:28:23,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,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-22 23:28:23,142 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,142 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,142 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,143 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:23,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,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-22 23:28:23,144 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,144 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,145 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:28:23,146 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:28:23,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,146 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-22 23:28:23,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,147 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,147 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,148 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,151 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,151 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,151 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,158 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,159 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,159 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,162 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,162 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,163 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,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-22 23:28:23,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,165 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,165 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,166 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,168 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,168 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,169 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,169 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:23,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,174 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,174 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,174 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,177 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,178 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,178 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,181 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,182 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,182 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,182 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:28:23,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,188 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,189 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,191 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,191 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:28:23,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:28:23,192 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:28:23,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,193 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-22 23:28: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-22 23:28:23,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,194 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,194 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,198 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,198 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,198 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,204 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,204 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,208 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,208 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,213 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,213 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,213 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,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-22 23:28:23,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,217 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,218 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,218 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,219 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:28:23,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,227 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,229 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,232 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,232 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,233 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,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-22 23:28:23,236 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,236 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,237 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:28:23,237 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,238 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:28:23,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28: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-22 23:28:23,247 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,247 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,248 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:28:23,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:28:23,252 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:28:23,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:28:23,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:28:23,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:28:23,252 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:28:23,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:28:23,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:28:23,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:28:23,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:28:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:28:23,256 INFO L87 Difference]: Start difference. First operand 264 states and 461 transitions. cyclomatic complexity: 198 Second operand 3 states. [2018-11-22 23:28:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:28:23,646 INFO L93 Difference]: Finished difference Result 442 states and 694 transitions. [2018-11-22 23:28:23,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:28:23,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 694 transitions. [2018-11-22 23:28:23,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 428 [2018-11-22 23:28:23,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 442 states and 694 transitions. [2018-11-22 23:28:23,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 442 [2018-11-22 23:28:23,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 442 [2018-11-22 23:28:23,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 694 transitions. [2018-11-22 23:28:23,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:28:23,652 INFO L705 BuchiCegarLoop]: Abstraction has 442 states and 694 transitions. [2018-11-22 23:28:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 694 transitions. [2018-11-22 23:28:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436. [2018-11-22 23:28:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-11-22 23:28:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 688 transitions. [2018-11-22 23:28:23,664 INFO L728 BuchiCegarLoop]: Abstraction has 436 states and 688 transitions. [2018-11-22 23:28:23,664 INFO L608 BuchiCegarLoop]: Abstraction has 436 states and 688 transitions. [2018-11-22 23:28:23,664 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 23:28:23,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 436 states and 688 transitions. [2018-11-22 23:28:23,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 422 [2018-11-22 23:28:23,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:28:23,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:28:23,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:23,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:23,667 INFO L794 eck$LassoCheckResult]: Stem: 1986#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_memory4~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; 1824#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; 1825#L1181 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 2098#L1181-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 2099#L1186-1 assume !(1 == ~m_run_pc~0); 1921#L1198 assume !(2 == ~m_run_pc~0); 1922#L1206 assume !(3 == ~m_run_pc~0); 1958#L1214 assume !(4 == ~m_run_pc~0); 1991#L1222 assume !(5 == ~m_run_pc~0); 1992#L1230 assume !(6 == ~m_run_pc~0); 1945#L1231 assume !(2 == ~s_run_pc~0); 1946#L1252 assume !(1 == ~s_run_pc~0); 1838#L1347-1 [2018-11-22 23:28:23,667 INFO L796 eck$LassoCheckResult]: Loop: 1838#L1347-1 assume !false; 1835#L1265 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; 1836#L1154 assume !false; 1927#L1129 assume !(0 == ~m_run_st~0); 1803#L1133 assume !(0 == ~s_run_st~0); 1805#L1170 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 1951#L1272 assume !(1 == ~m_run_pc~0); 1952#L1279 assume !(2 == ~m_run_pc~0); 1830#L1287 assume !(3 == ~m_run_pc~0); 1831#L1295 assume !(4 == ~m_run_pc~0); 1889#L1303 assume !(5 == ~m_run_pc~0); 1890#L1311 assume !(6 == ~m_run_pc~0); 2024#L1312 assume 2 == ~s_run_pc~0; 1973#L1327 assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 1974#L1334 assume 0 == ~m_run_st~0; 1838#L1347-1 [2018-11-22 23:28:23,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1577837401, now seen corresponding path program 1 times [2018-11-22 23:28:23,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:23,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:28:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1058496993, now seen corresponding path program 1 times [2018-11-22 23:28:23,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:23,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:23,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:28:23,709 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-22 23:28:23,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:28:23,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:28:23,709 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:28:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:28:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:28:23,710 INFO L87 Difference]: Start difference. First operand 436 states and 688 transitions. cyclomatic complexity: 253 Second operand 3 states. [2018-11-22 23:28:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:28:23,779 INFO L93 Difference]: Finished difference Result 708 states and 1141 transitions. [2018-11-22 23:28:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:28:23,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 708 states and 1141 transitions. [2018-11-22 23:28:23,783 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 685 [2018-11-22 23:28:23,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 708 states to 708 states and 1141 transitions. [2018-11-22 23:28:23,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 708 [2018-11-22 23:28:23,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 708 [2018-11-22 23:28:23,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 708 states and 1141 transitions. [2018-11-22 23:28:23,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:28:23,789 INFO L705 BuchiCegarLoop]: Abstraction has 708 states and 1141 transitions. [2018-11-22 23:28:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states and 1141 transitions. [2018-11-22 23:28:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 702. [2018-11-22 23:28:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-11-22 23:28:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1135 transitions. [2018-11-22 23:28:23,800 INFO L728 BuchiCegarLoop]: Abstraction has 702 states and 1135 transitions. [2018-11-22 23:28:23,800 INFO L608 BuchiCegarLoop]: Abstraction has 702 states and 1135 transitions. [2018-11-22 23:28:23,800 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 23:28:23,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 702 states and 1135 transitions. [2018-11-22 23:28:23,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 679 [2018-11-22 23:28:23,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:28:23,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:28:23,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:23,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-22 23:28:23,804 INFO L794 eck$LassoCheckResult]: Stem: 3143#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_memory4~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; 2973#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; 2974#L1181 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 3244#L1181-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 3245#L1186-1 assume !(1 == ~m_run_pc~0); 3071#L1198 assume !(2 == ~m_run_pc~0); 3072#L1206 assume !(3 == ~m_run_pc~0); 3114#L1214 assume !(4 == ~m_run_pc~0); 3148#L1222 assume !(5 == ~m_run_pc~0); 3149#L1230 assume !(6 == ~m_run_pc~0); 3099#L1231 assume !(2 == ~s_run_pc~0); 3100#L1252 assume !(1 == ~s_run_pc~0); 2987#L1347-1 assume !false; 3495#L1265 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; 3490#L1154 [2018-11-22 23:28:23,804 INFO L796 eck$LassoCheckResult]: Loop: 3490#L1154 assume !false; 3489#L1129 assume 0 == ~m_run_st~0; 3488#L1133-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 3077#L1143 assume !(0 != eval_~tmp~0); 3078#L1139 assume !(0 == ~s_run_st~0); 3490#L1154 [2018-11-22 23:28:23,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 1 times [2018-11-22 23:28:23,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:23,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:23,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:23,816 INFO L82 PathProgramCache]: Analyzing trace with hash 151895599, now seen corresponding path program 1 times [2018-11-22 23:28:23,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:23,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:23,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:23,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash -840624491, now seen corresponding path program 1 times [2018-11-22 23:28:23,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:23,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:23,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:23,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:28:23,836 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-22 23:28:23,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:28:23,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:28:23,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:28:23,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:28:23,849 INFO L87 Difference]: Start difference. First operand 702 states and 1135 transitions. cyclomatic complexity: 436 Second operand 3 states. [2018-11-22 23:28:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:28:23,897 INFO L93 Difference]: Finished difference Result 1326 states and 2142 transitions. [2018-11-22 23:28:23,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:28:23,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1326 states and 2142 transitions. [2018-11-22 23:28:23,903 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1295 [2018-11-22 23:28:23,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1326 states to 1326 states and 2142 transitions. [2018-11-22 23:28:23,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1326 [2018-11-22 23:28:23,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1326 [2018-11-22 23:28:23,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1326 states and 2142 transitions. [2018-11-22 23:28:23,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:28:23,911 INFO L705 BuchiCegarLoop]: Abstraction has 1326 states and 2142 transitions. [2018-11-22 23:28:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states and 2142 transitions. [2018-11-22 23:28:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1114. [2018-11-22 23:28:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2018-11-22 23:28:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1802 transitions. [2018-11-22 23:28:23,925 INFO L728 BuchiCegarLoop]: Abstraction has 1114 states and 1802 transitions. [2018-11-22 23:28:23,925 INFO L608 BuchiCegarLoop]: Abstraction has 1114 states and 1802 transitions. [2018-11-22 23:28:23,925 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 23:28:23,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1114 states and 1802 transitions. [2018-11-22 23:28:23,930 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1083 [2018-11-22 23:28:23,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:28:23,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:28:23,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:28:23,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:28:23,930 INFO L794 eck$LassoCheckResult]: Stem: 5191#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_memory4~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; 5013#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; 5014#L1181 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 5309#L1181-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 5312#L1186-1 assume !(1 == ~m_run_pc~0); 5117#L1198 assume !(2 == ~m_run_pc~0); 5118#L1206 assume !(3 == ~m_run_pc~0); 5161#L1214 assume !(4 == ~m_run_pc~0); 5198#L1222 assume !(5 == ~m_run_pc~0); 5199#L1230 assume !(6 == ~m_run_pc~0); 5143#L1231 assume !(2 == ~s_run_pc~0); 5144#L1252 assume !(1 == ~s_run_pc~0); 5025#L1347-1 assume !false; 5393#L1265 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; 5388#L1154 [2018-11-22 23:28:23,931 INFO L796 eck$LassoCheckResult]: Loop: 5388#L1154 assume !false; 5385#L1129 assume 0 == ~m_run_st~0; 5382#L1133-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 5120#L1143 assume !(0 != eval_~tmp~0); 5121#L1139 assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 5391#L1158 assume !(0 != eval_~tmp___0~0); 5388#L1154 [2018-11-22 23:28:23,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 2 times [2018-11-22 23:28:23,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:23,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:23,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:23,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash 413786785, now seen corresponding path program 1 times [2018-11-22 23:28:23,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:23,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:23,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:28:23,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:28:23,947 INFO L82 PathProgramCache]: Analyzing trace with hash -289564933, now seen corresponding path program 1 times [2018-11-22 23:28:23,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:28:23,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:28:23,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:28:23,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:28:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:28:24,326 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 126 ----- 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_memory4~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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181-L1185] assume 1 == ~m_run_i~0; [L1182] ~m_run_st~0 := 0; [L1186-L1190] assume 1 == ~s_run_i~0; [L1187] ~s_run_st~0 := 0; [L1191-L1244] assume !(1 == ~m_run_pc~0); [L1199-L1243] assume !(2 == ~m_run_pc~0); [L1207-L1242] assume !(3 == ~m_run_pc~0); [L1215-L1241] assume !(4 == ~m_run_pc~0); [L1223-L1240] assume !(5 == ~m_run_pc~0); [L1231-L1239] assume !(6 == ~m_run_pc~0); [L1245-L1262] assume !(2 == ~s_run_pc~0); [L1253-L1261] assume !(1 == ~s_run_pc~0); [L1264-L1353] assume !false; [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181-L1185] assume 1 == ~m_run_i~0; [L1182] ~m_run_st~0 := 0; [L1186-L1190] assume 1 == ~s_run_i~0; [L1187] ~s_run_st~0 := 0; [L1191-L1244] assume !(1 == ~m_run_pc~0); [L1199-L1243] assume !(2 == ~m_run_pc~0); [L1207-L1242] assume !(3 == ~m_run_pc~0); [L1215-L1241] assume !(4 == ~m_run_pc~0); [L1223-L1240] assume !(5 == ~m_run_pc~0); [L1231-L1239] assume !(6 == ~m_run_pc~0); [L1245-L1262] assume !(2 == ~s_run_pc~0); [L1253-L1261] assume !(1 == ~s_run_pc~0); [L1264-L1353] assume !false; [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [L1361] havoc ~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1177] havoc ~kernel_st~0; [L1180] ~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] ~kernel_st~0 := 1; [L1123] havoc ~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [L1361] havoc ~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1177] havoc ~kernel_st~0; [L1180] ~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] ~kernel_st~0 := 1; [L1123] havoc ~tmp~0; [L1124] 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 ; [L22] int s_memory4 ; [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 ; [L854] static int req_t_type___0 ; [L855] static int req_t_a___0 ; [L856] static int req_t_d___0 ; [L857] static int rsp_t_type___0 ; [L858] static int rsp_t_status___0 ; [L859] static int rsp_t_d___0 ; [L1361] int __retres1 ; [L1365] c_m_lock = 0 [L1366] c_m_ev = 2 [L1368] m_run_i = 1 [L1369] m_run_pc = 0 [L1370] s_run_i = 1 [L1371] s_run_pc = 0 [L1372] c_empty_req = 1 [L1373] c_empty_rsp = 1 [L1374] c_read_req_ev = 2 [L1375] c_write_req_ev = 2 [L1376] c_read_rsp_ev = 2 [L1377] c_write_rsp_ev = 2 [L1378] c_m_lock = 0 [L1379] c_m_ev = 2 [L1177] int kernel_st ; [L1180] kernel_st = 0 [L1181] COND TRUE (int )m_run_i == 1 [L1182] m_run_st = 0 [L1186] COND TRUE (int )s_run_i == 1 [L1187] s_run_st = 0 [L1191] COND FALSE !((int )m_run_pc == 1) [L1199] COND FALSE !((int )m_run_pc == 2) [L1207] COND FALSE !((int )m_run_pc == 3) [L1215] COND FALSE !((int )m_run_pc == 4) [L1223] COND FALSE !((int )m_run_pc == 5) [L1231] COND FALSE !((int )m_run_pc == 6) [L1245] COND FALSE !((int )s_run_pc == 2) [L1253] COND FALSE !((int )s_run_pc == 1) [L1264] COND TRUE 1 [L1267] kernel_st = 1 [L1123] int tmp ; [L1124] 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); [L1128-L1169] assume !false; [L1130-L1138] assume 0 == ~m_run_st~0; [L1139-L1153] assume 0 == ~m_run_st~0; [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] assume !(0 != eval_~tmp~0); [L1154-L1168] assume 0 == ~s_run_st~0; [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1128-L1169] assume !false; [L1130-L1138] assume 0 == ~m_run_st~0; [L1139-L1153] assume 0 == ~m_run_st~0; [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] assume !(0 != eval_~tmp~0); [L1154-L1168] assume 0 == ~s_run_st~0; [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] assume !(0 != eval_~tmp___0~0); [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] COND FALSE !(0 != eval_~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] COND FALSE !(0 != eval_~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] COND FALSE !(0 != eval_~tmp___0~0) [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] ~tmp~0 := #t~nondet1; [L1141] havoc #t~nondet1; [L1143-L1150] COND FALSE !(0 != ~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] ~tmp___0~0 := #t~nondet2; [L1156] havoc #t~nondet2; [L1158-L1165] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] ~tmp~0 := #t~nondet1; [L1141] havoc #t~nondet1; [L1143-L1150] COND FALSE !(0 != ~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] ~tmp___0~0 := #t~nondet2; [L1156] havoc #t~nondet2; [L1158-L1165] COND FALSE !(0 != ~tmp___0~0) [L1128] COND TRUE 1 [L1130] COND TRUE (int )m_run_st == 0 [L1139] COND TRUE (int )m_run_st == 0 [L1141] tmp = __VERIFIER_nondet_int() [L1143] COND FALSE !(\read(tmp)) [L1154] COND TRUE (int )s_run_st == 0 [L1156] tmp___0 = __VERIFIER_nondet_int() [L1158] COND FALSE !(\read(tmp___0)) ----- [2018-11-22 23:28:24,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 11:28:24 BoogieIcfgContainer [2018-11-22 23:28:24,453 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 23:28:24,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:28:24,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:28:24,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:28:24,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:28:21" (3/4) ... [2018-11-22 23:28:24,457 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_memory4~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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181-L1185] assume 1 == ~m_run_i~0; [L1182] ~m_run_st~0 := 0; [L1186-L1190] assume 1 == ~s_run_i~0; [L1187] ~s_run_st~0 := 0; [L1191-L1244] assume !(1 == ~m_run_pc~0); [L1199-L1243] assume !(2 == ~m_run_pc~0); [L1207-L1242] assume !(3 == ~m_run_pc~0); [L1215-L1241] assume !(4 == ~m_run_pc~0); [L1223-L1240] assume !(5 == ~m_run_pc~0); [L1231-L1239] assume !(6 == ~m_run_pc~0); [L1245-L1262] assume !(2 == ~s_run_pc~0); [L1253-L1261] assume !(1 == ~s_run_pc~0); [L1264-L1353] assume !false; [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181-L1185] assume 1 == ~m_run_i~0; [L1182] ~m_run_st~0 := 0; [L1186-L1190] assume 1 == ~s_run_i~0; [L1187] ~s_run_st~0 := 0; [L1191-L1244] assume !(1 == ~m_run_pc~0); [L1199-L1243] assume !(2 == ~m_run_pc~0); [L1207-L1242] assume !(3 == ~m_run_pc~0); [L1215-L1241] assume !(4 == ~m_run_pc~0); [L1223-L1240] assume !(5 == ~m_run_pc~0); [L1231-L1239] assume !(6 == ~m_run_pc~0); [L1245-L1262] assume !(2 == ~s_run_pc~0); [L1253-L1261] assume !(1 == ~s_run_pc~0); [L1264-L1353] assume !false; [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [L1361] havoc ~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1177] havoc ~kernel_st~0; [L1180] ~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] ~kernel_st~0 := 1; [L1123] havoc ~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [L1361] havoc ~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1177] havoc ~kernel_st~0; [L1180] ~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] ~kernel_st~0 := 1; [L1123] havoc ~tmp~0; [L1124] 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 ; [L22] int s_memory4 ; [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 ; [L854] static int req_t_type___0 ; [L855] static int req_t_a___0 ; [L856] static int req_t_d___0 ; [L857] static int rsp_t_type___0 ; [L858] static int rsp_t_status___0 ; [L859] static int rsp_t_d___0 ; [L1361] int __retres1 ; [L1365] c_m_lock = 0 [L1366] c_m_ev = 2 [L1368] m_run_i = 1 [L1369] m_run_pc = 0 [L1370] s_run_i = 1 [L1371] s_run_pc = 0 [L1372] c_empty_req = 1 [L1373] c_empty_rsp = 1 [L1374] c_read_req_ev = 2 [L1375] c_write_req_ev = 2 [L1376] c_read_rsp_ev = 2 [L1377] c_write_rsp_ev = 2 [L1378] c_m_lock = 0 [L1379] c_m_ev = 2 [L1177] int kernel_st ; [L1180] kernel_st = 0 [L1181] COND TRUE (int )m_run_i == 1 [L1182] m_run_st = 0 [L1186] COND TRUE (int )s_run_i == 1 [L1187] s_run_st = 0 [L1191] COND FALSE !((int )m_run_pc == 1) [L1199] COND FALSE !((int )m_run_pc == 2) [L1207] COND FALSE !((int )m_run_pc == 3) [L1215] COND FALSE !((int )m_run_pc == 4) [L1223] COND FALSE !((int )m_run_pc == 5) [L1231] COND FALSE !((int )m_run_pc == 6) [L1245] COND FALSE !((int )s_run_pc == 2) [L1253] COND FALSE !((int )s_run_pc == 1) [L1264] COND TRUE 1 [L1267] kernel_st = 1 [L1123] int tmp ; [L1124] 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); [L1128-L1169] assume !false; [L1130-L1138] assume 0 == ~m_run_st~0; [L1139-L1153] assume 0 == ~m_run_st~0; [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] assume !(0 != eval_~tmp~0); [L1154-L1168] assume 0 == ~s_run_st~0; [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1128-L1169] assume !false; [L1130-L1138] assume 0 == ~m_run_st~0; [L1139-L1153] assume 0 == ~m_run_st~0; [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] assume !(0 != eval_~tmp~0); [L1154-L1168] assume 0 == ~s_run_st~0; [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] assume !(0 != eval_~tmp___0~0); [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] COND FALSE !(0 != eval_~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] COND FALSE !(0 != eval_~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] COND FALSE !(0 != eval_~tmp___0~0) [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] ~tmp~0 := #t~nondet1; [L1141] havoc #t~nondet1; [L1143-L1150] COND FALSE !(0 != ~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] ~tmp___0~0 := #t~nondet2; [L1156] havoc #t~nondet2; [L1158-L1165] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] ~tmp~0 := #t~nondet1; [L1141] havoc #t~nondet1; [L1143-L1150] COND FALSE !(0 != ~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] ~tmp___0~0 := #t~nondet2; [L1156] havoc #t~nondet2; [L1158-L1165] COND FALSE !(0 != ~tmp___0~0) [L1128] COND TRUE 1 [L1130] COND TRUE (int )m_run_st == 0 [L1139] COND TRUE (int )m_run_st == 0 [L1141] tmp = __VERIFIER_nondet_int() [L1143] COND FALSE !(\read(tmp)) [L1154] COND TRUE (int )s_run_st == 0 [L1156] tmp___0 = __VERIFIER_nondet_int() [L1158] COND FALSE !(\read(tmp___0)) ----- [2018-11-22 23:28:24,549 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8faa61a2-6ff4-43ba-b184-e1a868c0f2d7/bin-2019/uautomizer/witness.graphml [2018-11-22 23:28:24,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:28:24,551 INFO L168 Benchmark]: Toolchain (without parser) took 4688.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -213.3 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:28:24,552 INFO L168 Benchmark]: CDTParser took 0.15 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-22 23:28:24,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.02 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-22 23:28:24,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 932.3 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:28:24,553 INFO L168 Benchmark]: Boogie Preprocessor took 34.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 23:28:24,553 INFO L168 Benchmark]: RCFGBuilder took 762.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.6 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:28:24,553 INFO L168 Benchmark]: BuchiAutomizer took 3421.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -142.2 MB). Peak memory consumption was 363.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:28:24,554 INFO L168 Benchmark]: Witness Printer took 95.87 ms. Allocated memory is still 1.3 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-22 23:28:24,556 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.02 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 84.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 932.3 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 762.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.6 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3421.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -142.2 MB). Peak memory consumption was 363.4 MB. Max. memory is 11.5 GB. * Witness Printer took 95.87 ms. Allocated memory is still 1.3 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 1114 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. 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, 224 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1114 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2479 SDtfs, 1897 SDslu, 1026 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: inital31 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf94 smp100 dnf150 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 62ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 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: 1128]: 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, s_memory4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c6cf585=0, c_read_req_ev=2, c_req_a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12785ebf=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: 1128]: 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_memory4~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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181-L1185] assume 1 == ~m_run_i~0; [L1182] ~m_run_st~0 := 0; [L1186-L1190] assume 1 == ~s_run_i~0; [L1187] ~s_run_st~0 := 0; [L1191-L1244] assume !(1 == ~m_run_pc~0); [L1199-L1243] assume !(2 == ~m_run_pc~0); [L1207-L1242] assume !(3 == ~m_run_pc~0); [L1215-L1241] assume !(4 == ~m_run_pc~0); [L1223-L1240] assume !(5 == ~m_run_pc~0); [L1231-L1239] assume !(6 == ~m_run_pc~0); [L1245-L1262] assume !(2 == ~s_run_pc~0); [L1253-L1261] assume !(1 == ~s_run_pc~0); [L1264-L1353] assume !false; [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181-L1185] assume 1 == ~m_run_i~0; [L1182] ~m_run_st~0 := 0; [L1186-L1190] assume 1 == ~s_run_i~0; [L1187] ~s_run_st~0 := 0; [L1191-L1244] assume !(1 == ~m_run_pc~0); [L1199-L1243] assume !(2 == ~m_run_pc~0); [L1207-L1242] assume !(3 == ~m_run_pc~0); [L1215-L1241] assume !(4 == ~m_run_pc~0); [L1223-L1240] assume !(5 == ~m_run_pc~0); [L1231-L1239] assume !(6 == ~m_run_pc~0); [L1245-L1262] assume !(2 == ~s_run_pc~0); [L1253-L1261] assume !(1 == ~s_run_pc~0); [L1264-L1353] assume !false; [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [L1361] havoc ~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1177] havoc ~kernel_st~0; [L1180] ~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] ~kernel_st~0 := 1; [L1123] havoc ~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [L1361] havoc ~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1177] havoc ~kernel_st~0; [L1180] ~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] ~kernel_st~0 := 1; [L1123] havoc ~tmp~0; [L1124] 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 ; [L22] int s_memory4 ; [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 ; [L854] static int req_t_type___0 ; [L855] static int req_t_a___0 ; [L856] static int req_t_d___0 ; [L857] static int rsp_t_type___0 ; [L858] static int rsp_t_status___0 ; [L859] static int rsp_t_d___0 ; [L1361] int __retres1 ; [L1365] c_m_lock = 0 [L1366] c_m_ev = 2 [L1368] m_run_i = 1 [L1369] m_run_pc = 0 [L1370] s_run_i = 1 [L1371] s_run_pc = 0 [L1372] c_empty_req = 1 [L1373] c_empty_rsp = 1 [L1374] c_read_req_ev = 2 [L1375] c_write_req_ev = 2 [L1376] c_read_rsp_ev = 2 [L1377] c_write_rsp_ev = 2 [L1378] c_m_lock = 0 [L1379] c_m_ev = 2 [L1177] int kernel_st ; [L1180] kernel_st = 0 [L1181] COND TRUE (int )m_run_i == 1 [L1182] m_run_st = 0 [L1186] COND TRUE (int )s_run_i == 1 [L1187] s_run_st = 0 [L1191] COND FALSE !((int )m_run_pc == 1) [L1199] COND FALSE !((int )m_run_pc == 2) [L1207] COND FALSE !((int )m_run_pc == 3) [L1215] COND FALSE !((int )m_run_pc == 4) [L1223] COND FALSE !((int )m_run_pc == 5) [L1231] COND FALSE !((int )m_run_pc == 6) [L1245] COND FALSE !((int )s_run_pc == 2) [L1253] COND FALSE !((int )s_run_pc == 1) [L1264] COND TRUE 1 [L1267] kernel_st = 1 [L1123] int tmp ; [L1124] 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); [L1128-L1169] assume !false; [L1130-L1138] assume 0 == ~m_run_st~0; [L1139-L1153] assume 0 == ~m_run_st~0; [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] assume !(0 != eval_~tmp~0); [L1154-L1168] assume 0 == ~s_run_st~0; [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1128-L1169] assume !false; [L1130-L1138] assume 0 == ~m_run_st~0; [L1139-L1153] assume 0 == ~m_run_st~0; [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] assume !(0 != eval_~tmp~0); [L1154-L1168] assume 0 == ~s_run_st~0; [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] assume !(0 != eval_~tmp___0~0); [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] COND FALSE !(0 != eval_~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] COND FALSE !(0 != eval_~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] COND FALSE !(0 != eval_~tmp___0~0) [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] ~tmp~0 := #t~nondet1; [L1141] havoc #t~nondet1; [L1143-L1150] COND FALSE !(0 != ~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] ~tmp___0~0 := #t~nondet2; [L1156] havoc #t~nondet2; [L1158-L1165] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] ~tmp~0 := #t~nondet1; [L1141] havoc #t~nondet1; [L1143-L1150] COND FALSE !(0 != ~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] ~tmp___0~0 := #t~nondet2; [L1156] havoc #t~nondet2; [L1158-L1165] COND FALSE !(0 != ~tmp___0~0) [L1128] COND TRUE 1 [L1130] COND TRUE (int )m_run_st == 0 [L1139] COND TRUE (int )m_run_st == 0 [L1141] tmp = __VERIFIER_nondet_int() [L1143] COND FALSE !(\read(tmp)) [L1154] COND TRUE (int )s_run_st == 0 [L1156] tmp___0 = __VERIFIER_nondet_int() [L1158] 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_memory4~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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181-L1185] assume 1 == ~m_run_i~0; [L1182] ~m_run_st~0 := 0; [L1186-L1190] assume 1 == ~s_run_i~0; [L1187] ~s_run_st~0 := 0; [L1191-L1244] assume !(1 == ~m_run_pc~0); [L1199-L1243] assume !(2 == ~m_run_pc~0); [L1207-L1242] assume !(3 == ~m_run_pc~0); [L1215-L1241] assume !(4 == ~m_run_pc~0); [L1223-L1240] assume !(5 == ~m_run_pc~0); [L1231-L1239] assume !(6 == ~m_run_pc~0); [L1245-L1262] assume !(2 == ~s_run_pc~0); [L1253-L1261] assume !(1 == ~s_run_pc~0); [L1264-L1353] assume !false; [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181-L1185] assume 1 == ~m_run_i~0; [L1182] ~m_run_st~0 := 0; [L1186-L1190] assume 1 == ~s_run_i~0; [L1187] ~s_run_st~0 := 0; [L1191-L1244] assume !(1 == ~m_run_pc~0); [L1199-L1243] assume !(2 == ~m_run_pc~0); [L1207-L1242] assume !(3 == ~m_run_pc~0); [L1215-L1241] assume !(4 == ~m_run_pc~0); [L1223-L1240] assume !(5 == ~m_run_pc~0); [L1231-L1239] assume !(6 == ~m_run_pc~0); [L1245-L1262] assume !(2 == ~s_run_pc~0); [L1253-L1261] assume !(1 == ~s_run_pc~0); [L1264-L1353] assume !false; [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1361] havoc main_~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1380] havoc start_simulation_~kernel_st~0; [L1177] havoc start_simulation_~kernel_st~0; [L1180] start_simulation_~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] start_simulation_~kernel_st~0 := 1; [L1268] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1123] havoc eval_~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [L1361] havoc ~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1177] havoc ~kernel_st~0; [L1180] ~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] ~kernel_st~0 := 1; [L1123] havoc ~tmp~0; [L1124] 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; [L22] ~s_memory4~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; [L854] ~req_t_type___0~0 := 0; [L855] ~req_t_a___0~0 := 0; [L856] ~req_t_d___0~0 := 0; [L857] ~rsp_t_type___0~0 := 0; [L858] ~rsp_t_status___0~0 := 0; [L859] ~rsp_t_d___0~0 := 0; [L1361] havoc ~__retres1~0; [L1365] ~c_m_lock~0 := 0; [L1366] ~c_m_ev~0 := 2; [L1368] ~m_run_i~0 := 1; [L1369] ~m_run_pc~0 := 0; [L1370] ~s_run_i~0 := 1; [L1371] ~s_run_pc~0 := 0; [L1372] ~c_empty_req~0 := 1; [L1373] ~c_empty_rsp~0 := 1; [L1374] ~c_read_req_ev~0 := 2; [L1375] ~c_write_req_ev~0 := 2; [L1376] ~c_read_rsp_ev~0 := 2; [L1377] ~c_write_rsp_ev~0 := 2; [L1378] ~c_m_lock~0 := 0; [L1379] ~c_m_ev~0 := 2; [L1177] havoc ~kernel_st~0; [L1180] ~kernel_st~0 := 0; [L1181] COND TRUE 1 == ~m_run_i~0 [L1182] ~m_run_st~0 := 0; [L1186] COND TRUE 1 == ~s_run_i~0 [L1187] ~s_run_st~0 := 0; [L1191] COND FALSE !(1 == ~m_run_pc~0) [L1199] COND FALSE !(2 == ~m_run_pc~0) [L1207] COND FALSE !(3 == ~m_run_pc~0) [L1215] COND FALSE !(4 == ~m_run_pc~0) [L1223] COND FALSE !(5 == ~m_run_pc~0) [L1231] COND FALSE !(6 == ~m_run_pc~0) [L1245] COND FALSE !(2 == ~s_run_pc~0) [L1253] COND FALSE !(1 == ~s_run_pc~0) [L1264-L1353] COND FALSE !(false) [L1267] ~kernel_st~0 := 1; [L1123] havoc ~tmp~0; [L1124] 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 ; [L22] int s_memory4 ; [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 ; [L854] static int req_t_type___0 ; [L855] static int req_t_a___0 ; [L856] static int req_t_d___0 ; [L857] static int rsp_t_type___0 ; [L858] static int rsp_t_status___0 ; [L859] static int rsp_t_d___0 ; [L1361] int __retres1 ; [L1365] c_m_lock = 0 [L1366] c_m_ev = 2 [L1368] m_run_i = 1 [L1369] m_run_pc = 0 [L1370] s_run_i = 1 [L1371] s_run_pc = 0 [L1372] c_empty_req = 1 [L1373] c_empty_rsp = 1 [L1374] c_read_req_ev = 2 [L1375] c_write_req_ev = 2 [L1376] c_read_rsp_ev = 2 [L1377] c_write_rsp_ev = 2 [L1378] c_m_lock = 0 [L1379] c_m_ev = 2 [L1177] int kernel_st ; [L1180] kernel_st = 0 [L1181] COND TRUE (int )m_run_i == 1 [L1182] m_run_st = 0 [L1186] COND TRUE (int )s_run_i == 1 [L1187] s_run_st = 0 [L1191] COND FALSE !((int )m_run_pc == 1) [L1199] COND FALSE !((int )m_run_pc == 2) [L1207] COND FALSE !((int )m_run_pc == 3) [L1215] COND FALSE !((int )m_run_pc == 4) [L1223] COND FALSE !((int )m_run_pc == 5) [L1231] COND FALSE !((int )m_run_pc == 6) [L1245] COND FALSE !((int )s_run_pc == 2) [L1253] COND FALSE !((int )s_run_pc == 1) [L1264] COND TRUE 1 [L1267] kernel_st = 1 [L1123] int tmp ; [L1124] 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); [L1128-L1169] assume !false; [L1130-L1138] assume 0 == ~m_run_st~0; [L1139-L1153] assume 0 == ~m_run_st~0; [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] assume !(0 != eval_~tmp~0); [L1154-L1168] assume 0 == ~s_run_st~0; [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1128-L1169] assume !false; [L1130-L1138] assume 0 == ~m_run_st~0; [L1139-L1153] assume 0 == ~m_run_st~0; [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] assume !(0 != eval_~tmp~0); [L1154-L1168] assume 0 == ~s_run_st~0; [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] assume !(0 != eval_~tmp___0~0); [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] COND FALSE !(0 != eval_~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] eval_~tmp~0 := eval_#t~nondet1; [L1141] havoc eval_#t~nondet1; [L1143-L1150] COND FALSE !(0 != eval_~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] eval_~tmp___0~0 := eval_#t~nondet2; [L1156] havoc eval_#t~nondet2; [L1158-L1165] COND FALSE !(0 != eval_~tmp___0~0) [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] ~tmp~0 := #t~nondet1; [L1141] havoc #t~nondet1; [L1143-L1150] COND FALSE !(0 != ~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] ~tmp___0~0 := #t~nondet2; [L1156] havoc #t~nondet2; [L1158-L1165] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1128-L1169] COND FALSE !(false) [L1130] COND TRUE 0 == ~m_run_st~0 [L1139] COND TRUE 0 == ~m_run_st~0 [L1141] ~tmp~0 := #t~nondet1; [L1141] havoc #t~nondet1; [L1143-L1150] COND FALSE !(0 != ~tmp~0) [L1154] COND TRUE 0 == ~s_run_st~0 [L1156] ~tmp___0~0 := #t~nondet2; [L1156] havoc #t~nondet2; [L1158-L1165] COND FALSE !(0 != ~tmp___0~0) [L1128] COND TRUE 1 [L1130] COND TRUE (int )m_run_st == 0 [L1139] COND TRUE (int )m_run_st == 0 [L1141] tmp = __VERIFIER_nondet_int() [L1143] COND FALSE !(\read(tmp)) [L1154] COND TRUE (int )s_run_st == 0 [L1156] tmp___0 = __VERIFIER_nondet_int() [L1158] 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 ; [L22] int s_memory4 ; [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 ; [L854] static int req_t_type___0 ; [L855] static int req_t_a___0 ; [L856] static int req_t_d___0 ; [L857] static int rsp_t_type___0 ; [L858] static int rsp_t_status___0 ; [L859] static int rsp_t_d___0 ; [L1361] int __retres1 ; [L1365] c_m_lock = 0 [L1366] c_m_ev = 2 [L1368] m_run_i = 1 [L1369] m_run_pc = 0 [L1370] s_run_i = 1 [L1371] s_run_pc = 0 [L1372] c_empty_req = 1 [L1373] c_empty_rsp = 1 [L1374] c_read_req_ev = 2 [L1375] c_write_req_ev = 2 [L1376] c_read_rsp_ev = 2 [L1377] c_write_rsp_ev = 2 [L1378] c_m_lock = 0 [L1379] c_m_ev = 2 [L1177] int kernel_st ; [L1180] kernel_st = 0 [L1181] COND TRUE (int )m_run_i == 1 [L1182] m_run_st = 0 [L1186] COND TRUE (int )s_run_i == 1 [L1187] s_run_st = 0 [L1191] COND FALSE !((int )m_run_pc == 1) [L1199] COND FALSE !((int )m_run_pc == 2) [L1207] COND FALSE !((int )m_run_pc == 3) [L1215] COND FALSE !((int )m_run_pc == 4) [L1223] COND FALSE !((int )m_run_pc == 5) [L1231] COND FALSE !((int )m_run_pc == 6) [L1245] COND FALSE !((int )s_run_pc == 2) [L1253] COND FALSE !((int )s_run_pc == 1) [L1264] COND TRUE 1 [L1267] kernel_st = 1 [L1123] int tmp ; [L1124] int tmp___0 ; Loop: [L1128] COND TRUE 1 [L1130] COND TRUE (int )m_run_st == 0 [L1139] COND TRUE (int )m_run_st == 0 [L1141] tmp = __VERIFIER_nondet_int() [L1143] COND FALSE !(\read(tmp)) [L1154] COND TRUE (int )s_run_st == 0 [L1156] tmp___0 = __VERIFIER_nondet_int() [L1158] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...