./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.2_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_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.2_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/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 7974185e330e91a4e9731c3e8d6ea997b9a774a6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:19:33,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:19:33,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:19:33,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:19:33,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:19:33,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:19:33,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:19:33,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:19:33,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:19:33,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:19:33,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:19:33,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:19:33,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:19:33,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:19:33,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:19:33,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:19:33,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:19:33,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:19:33,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:19:33,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:19:33,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:19:33,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:19:33,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:19:33,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:19:33,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:19:33,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:19:33,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:19:33,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:19:33,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:19:33,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:19:33,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:19:33,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:19:33,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:19:33,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:19:33,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:19:33,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:19:33,308 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 14:19:33,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:19:33,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:19:33,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:19:33,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:19:33,316 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:19:33,317 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:19:33,317 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:19:33,317 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:19:33,317 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:19:33,317 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:19:33,317 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:19:33,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:19:33,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:19:33,318 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:19:33,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:19:33,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:19:33,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:19:33,318 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:19:33,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:19:33,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:19:33,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:19:33,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:19:33,319 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:19:33,319 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:19:33,319 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:19:33,319 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:19:33,319 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:19:33,320 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:19:33,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:19:33,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:19:33,320 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:19:33,321 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:19:33,321 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_a3c535e5-51ec-4181-bdb9-fac741ca7881/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 -> 7974185e330e91a4e9731c3e8d6ea997b9a774a6 [2018-11-23 14:19:33,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:19:33,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:19:33,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:19:33,356 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:19:33,357 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:19:33,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.2_true-unreach-call_false-termination.cil.c [2018-11-23 14:19:33,404 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/data/827edccd1/d1e00c81e4a94ae0ba9ca3678adf4f68/FLAG989a2df0e [2018-11-23 14:19:33,771 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:19:33,772 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/sv-benchmarks/c/systemc/mem_slave_tlm.2_true-unreach-call_false-termination.cil.c [2018-11-23 14:19:33,782 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/data/827edccd1/d1e00c81e4a94ae0ba9ca3678adf4f68/FLAG989a2df0e [2018-11-23 14:19:33,796 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/data/827edccd1/d1e00c81e4a94ae0ba9ca3678adf4f68 [2018-11-23 14:19:33,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:19:33,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:19:33,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:19:33,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:19:33,805 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:19:33,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:19:33" (1/1) ... [2018-11-23 14:19:33,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3438b8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:33, skipping insertion in model container [2018-11-23 14:19:33,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:19:33" (1/1) ... [2018-11-23 14:19:33,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:19:33,861 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:19:34,066 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:19:34,069 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:19:34,124 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:19:34,135 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:19:34,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34 WrapperNode [2018-11-23 14:19:34,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:19:34,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:19:34,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:19:34,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:19:34,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... [2018-11-23 14:19:34,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... [2018-11-23 14:19:34,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:19:34,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:19:34,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:19:34,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:19:34,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... [2018-11-23 14:19:34,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... [2018-11-23 14:19:34,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... [2018-11-23 14:19:34,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... [2018-11-23 14:19:34,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... [2018-11-23 14:19:34,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... [2018-11-23 14:19:34,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... [2018-11-23 14:19:34,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:19:34,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:19:34,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:19:34,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:19:34,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:19:34,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:19:34,998 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:19:34,998 INFO L280 CfgBuilder]: Removed 39 assue(true) statements. [2018-11-23 14:19:34,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:19:34 BoogieIcfgContainer [2018-11-23 14:19:34,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:19:34,999 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:19:34,999 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:19:35,002 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:19:35,003 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:19:35,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:19:33" (1/3) ... [2018-11-23 14:19:35,004 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9577cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:19:35, skipping insertion in model container [2018-11-23 14:19:35,004 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:19:35,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:19:34" (2/3) ... [2018-11-23 14:19:35,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9577cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:19:35, skipping insertion in model container [2018-11-23 14:19:35,005 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:19:35,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:19:34" (3/3) ... [2018-11-23 14:19:35,006 INFO L375 chiAutomizerObserver]: Analyzing ICFG mem_slave_tlm.2_true-unreach-call_false-termination.cil.c [2018-11-23 14:19:35,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:19:35,060 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:19:35,061 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:19:35,061 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:19:35,061 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:19:35,061 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:19:35,061 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:19:35,061 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:19:35,061 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:19:35,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 267 states. [2018-11-23 14:19:35,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 243 [2018-11-23 14:19:35,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:19:35,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:19:35,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:35,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:35,116 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:19:35,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 267 states. [2018-11-23 14:19:35,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 243 [2018-11-23 14:19:35,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:19:35,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:19:35,122 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:35,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:35,128 INFO L794 eck$LassoCheckResult]: Stem: 113#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_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; 119#L1167true assume !(1 == ~m_run_i~0);~m_run_st~0 := 2; 102#L1167-2true assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 133#L1172-1true assume 1 == ~m_run_pc~0; 120#L1178true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 81#L1217true assume !(2 == ~s_run_pc~0); 140#L1238true assume !(1 == ~s_run_pc~0); 191#L1333-1true [2018-11-23 14:19:35,128 INFO L796 eck$LassoCheckResult]: Loop: 191#L1333-1true assume !false; 163#L1251true 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; 207#L1140true assume !true; 100#L1156true start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 236#L1258true assume 1 == ~m_run_pc~0; 49#L1259true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 17#L1298true assume !(2 == ~s_run_pc~0); 69#L1319true assume !(1 == ~s_run_pc~0); 16#L1320true assume 0 == ~m_run_st~0; 191#L1333-1true [2018-11-23 14:19:35,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash 180491512, now seen corresponding path program 1 times [2018-11-23 14:19:35,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:35,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:35,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:35,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:19:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:19:35,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:19:35,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:19:35,240 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:19:35,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:35,241 INFO L82 PathProgramCache]: Analyzing trace with hash 384862316, now seen corresponding path program 1 times [2018-11-23 14:19:35,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:35,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:35,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:35,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:35,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:19:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:19:35,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:19:35,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:19:35,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 14:19:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:19:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:19:35,260 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 3 states. [2018-11-23 14:19:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:19:35,287 INFO L93 Difference]: Finished difference Result 267 states and 459 transitions. [2018-11-23 14:19:35,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:19:35,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 459 transitions. [2018-11-23 14:19:35,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 238 [2018-11-23 14:19:35,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 258 states and 450 transitions. [2018-11-23 14:19:35,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2018-11-23 14:19:35,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2018-11-23 14:19:35,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 450 transitions. [2018-11-23 14:19:35,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:19:35,303 INFO L705 BuchiCegarLoop]: Abstraction has 258 states and 450 transitions. [2018-11-23 14:19:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 450 transitions. [2018-11-23 14:19:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-11-23 14:19:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-23 14:19:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 450 transitions. [2018-11-23 14:19:35,336 INFO L728 BuchiCegarLoop]: Abstraction has 258 states and 450 transitions. [2018-11-23 14:19:35,337 INFO L608 BuchiCegarLoop]: Abstraction has 258 states and 450 transitions. [2018-11-23 14:19:35,337 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:19:35,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 450 transitions. [2018-11-23 14:19:35,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 238 [2018-11-23 14:19:35,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:19:35,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:19:35,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:35,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:35,339 INFO L794 eck$LassoCheckResult]: Stem: 733#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_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; 568#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; 569#L1167 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 725#L1167-2 assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 726#L1172-1 assume 1 == ~m_run_pc~0; 737#L1178 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 597#L1217 assume !(2 == ~s_run_pc~0); 590#L1238 assume !(1 == ~s_run_pc~0); 573#L1333-1 [2018-11-23 14:19:35,340 INFO L796 eck$LassoCheckResult]: Loop: 573#L1333-1 assume !false; 775#L1251 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; 549#L1140 assume !false; 796#L1115 assume !(0 == ~m_run_st~0); 778#L1119 assume !(0 == ~s_run_st~0); 723#L1156 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 724#L1258 assume 1 == ~m_run_pc~0; 644#L1259 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 575#L1298 assume !(2 == ~s_run_pc~0); 576#L1319 assume !(1 == ~s_run_pc~0); 572#L1320 assume 0 == ~m_run_st~0; 573#L1333-1 [2018-11-23 14:19:35,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:35,340 INFO L82 PathProgramCache]: Analyzing trace with hash 123233210, now seen corresponding path program 1 times [2018-11-23 14:19:35,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:35,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:35,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:35,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:35,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:19:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:19:35,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:19:35,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:19:35,367 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:19:35,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1647677193, now seen corresponding path program 1 times [2018-11-23 14:19:35,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:35,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:35,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:35,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:35,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:35,441 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:19:35,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:19:35,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:19:35,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:19:35,442 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 14:19:35,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:35,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:19:35,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:19:35,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.2_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-23 14:19:35,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:19:35,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:19:35,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,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-23 14:19:35,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-23 14:19:35,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-23 14:19:35,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,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-23 14:19:35,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,565 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:19:35,565 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:35,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:19:35,571 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:35,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 14:19:35,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:19:35,609 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 14:19:35,610 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:19:35,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:19:35,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:19:35,610 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:19:35,610 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:19:35,611 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:35,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:19:35,611 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:19:35,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.2_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-23 14:19:35,611 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:19:35,611 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:19:35,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:35,721 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:19:35,725 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:19:35,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,731 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,732 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:35,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,743 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,744 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,746 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,747 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:35,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:35,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:35,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:35,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:35,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:35,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:35,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,767 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 14:19:35,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,768 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,768 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:35,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,778 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,780 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,780 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:35,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,782 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:35,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,786 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,787 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,790 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,791 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,795 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,796 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,800 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,800 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,803 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,804 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,808 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,809 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,810 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 14:19:35,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,811 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:35,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,822 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,824 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,825 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:35,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,827 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,828 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:35,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,830 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,831 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,836 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,841 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,847 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,854 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,857 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,857 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,863 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 14:19:35,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,865 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,865 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,866 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:35,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,874 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,875 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:35,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,877 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,877 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,877 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:35,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,879 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,879 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,880 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:35,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,883 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,883 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:35,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,887 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,888 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:35,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,893 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,893 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:35,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,896 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:35,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,901 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:35,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:35,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:35,906 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:35,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,907 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 14:19:35,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,908 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,910 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,910 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:35,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,923 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,923 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,924 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,927 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,927 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:35,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,931 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,931 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,931 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:35,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,938 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,939 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,940 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,947 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,948 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,958 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,959 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,960 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,961 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,963 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,963 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,964 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,969 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,969 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,969 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,970 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,972 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:35,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,973 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:35,973 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:35,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,975 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 14:19:35,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-23 14:19:35,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,976 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:35,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,976 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,976 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,978 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:35,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:35,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,992 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:35,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:35,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:35,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:35,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:35,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:35,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-23 14:19:35,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:35,998 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:35,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:35,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:35,999 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:35,999 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,000 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:36,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,003 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:36,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,004 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,005 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:36,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,013 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:36,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,014 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,015 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,021 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:36,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,021 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,022 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,029 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:36,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,030 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,034 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:36,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,034 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,036 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,042 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:36,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,043 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,043 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,046 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:36,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,049 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,051 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 14:19:36,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,052 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,053 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,053 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,055 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:36,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,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-23 14:19:36,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,093 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,094 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:36,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,097 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,097 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,098 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,100 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:36,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,102 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,103 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,103 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,106 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:36,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,117 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,117 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,118 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,119 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:36,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,126 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,127 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,128 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:36,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,136 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,136 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,137 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:36,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,139 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,140 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,141 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:36,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,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-23 14:19:36,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,149 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,150 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:36,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,152 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,153 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:36,154 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:36,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,155 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 14:19:36,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,156 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,157 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,158 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:36,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,165 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,166 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,166 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,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-23 14:19:36,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,169 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,169 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,169 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,170 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:36,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,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-23 14:19:36,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,173 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,174 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,174 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,174 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:36,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,179 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,183 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,184 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,192 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,193 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,193 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,197 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,197 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,198 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,201 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,206 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,207 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:36,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,214 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:36,215 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,217 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 14:19:36,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,218 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,218 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,219 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,219 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,220 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 14:19:36,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,241 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,241 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,242 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:36,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,246 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,246 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,246 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,247 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 14:19:36,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,250 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,250 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,250 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,250 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,251 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 14:19:36,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,257 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,257 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:36,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,262 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,262 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:36,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,271 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,271 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,271 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:36,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,275 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,276 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:36,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,281 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,281 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:36,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:36,285 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:36,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,286 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:36,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:36,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:19:36,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:19:36,290 INFO L87 Difference]: Start difference. First operand 258 states and 450 transitions. cyclomatic complexity: 193 Second operand 3 states. [2018-11-23 14:19:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:19:36,307 INFO L93 Difference]: Finished difference Result 258 states and 449 transitions. [2018-11-23 14:19:36,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:19:36,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 449 transitions. [2018-11-23 14:19:36,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 238 [2018-11-23 14:19:36,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 449 transitions. [2018-11-23 14:19:36,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2018-11-23 14:19:36,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2018-11-23 14:19:36,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 449 transitions. [2018-11-23 14:19:36,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:19:36,316 INFO L705 BuchiCegarLoop]: Abstraction has 258 states and 449 transitions. [2018-11-23 14:19:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 449 transitions. [2018-11-23 14:19:36,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-11-23 14:19:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-23 14:19:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 449 transitions. [2018-11-23 14:19:36,326 INFO L728 BuchiCegarLoop]: Abstraction has 258 states and 449 transitions. [2018-11-23 14:19:36,326 INFO L608 BuchiCegarLoop]: Abstraction has 258 states and 449 transitions. [2018-11-23 14:19:36,326 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:19:36,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 449 transitions. [2018-11-23 14:19:36,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 238 [2018-11-23 14:19:36,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:19:36,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:19:36,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:36,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:36,328 INFO L794 eck$LassoCheckResult]: Stem: 1255#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_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; 1090#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; 1091#L1167 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 1247#L1167-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 1248#L1172-1 assume 1 == ~m_run_pc~0; 1259#L1178 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1119#L1217 assume !(2 == ~s_run_pc~0); 1113#L1238 assume !(1 == ~s_run_pc~0); 1095#L1333-1 [2018-11-23 14:19:36,328 INFO L796 eck$LassoCheckResult]: Loop: 1095#L1333-1 assume !false; 1297#L1251 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; 1071#L1140 assume !false; 1318#L1115 assume !(0 == ~m_run_st~0); 1300#L1119 assume !(0 == ~s_run_st~0); 1245#L1156 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 1246#L1258 assume 1 == ~m_run_pc~0; 1166#L1259 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1097#L1298 assume !(2 == ~s_run_pc~0); 1098#L1319 assume !(1 == ~s_run_pc~0); 1094#L1320 assume 0 == ~m_run_st~0; 1095#L1333-1 [2018-11-23 14:19:36,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:36,328 INFO L82 PathProgramCache]: Analyzing trace with hash 121386168, now seen corresponding path program 1 times [2018-11-23 14:19:36,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:36,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:36,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:19:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:19:36,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:19:36,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:19:36,354 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:19:36,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1647677193, now seen corresponding path program 2 times [2018-11-23 14:19:36,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:36,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:36,425 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:19:36,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:19:36,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:19:36,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:19:36,426 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 14:19:36,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:19:36,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:19:36,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.2_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 14:19:36,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:19:36,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:19:36,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,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-23 14:19:36,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,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-23 14:19:36,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:19:36,567 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:19:36,570 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:19:36,574 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 14:19:36,574 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_pc~0=7} Honda state: {~s_run_pc~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:19:36,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:19:36,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 14:19:36,614 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_st~0=7} Honda state: {~s_run_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:19:36,649 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:19:36,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 14:19:36,678 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_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:19:36,698 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:19:36,702 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 14:19:36,702 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_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,720 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:19:36,720 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:19:36,722 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 14:19:36,722 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_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:19:36,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:19:36,746 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 14:19:36,746 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_m_ev~0=1} Honda state: {~c_m_ev~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:19:36,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:19:36,776 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 14:19:36,776 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:19:36,803 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-23 14:19:36,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 14:19:36,835 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,866 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 14:19:36,868 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:19:36,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:19:36,868 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:19:36,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:19:36,868 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:19:36,868 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:19:36,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:19:36,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:19:36,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.2_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 14:19:36,869 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:19:36,869 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:19:36,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:19:36,982 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:19:36,982 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:19:36,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-23 14:19:36,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,983 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,983 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,985 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,985 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,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-23 14:19:36,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:36,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:36,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:36,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:36,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,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-23 14:19:36,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:36,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,995 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:36,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,995 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:36,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:36,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:36,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:36,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:36,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:36,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:36,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:19:36,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:19:36,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:36,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:36,999 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 14:19:36,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,000 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,000 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,001 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,001 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,003 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,003 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,005 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,006 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,007 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,007 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,009 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,009 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,011 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,011 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,012 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,013 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,016 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,016 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,017 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,017 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,018 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 14:19:37,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-23 14:19:37,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,019 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,019 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,019 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:37,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,021 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,021 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,021 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:37,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,023 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,023 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,026 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,026 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,028 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,028 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,030 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,032 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,033 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,035 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,035 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,035 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:37,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,039 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,040 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,041 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,041 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 14:19:37,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,042 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,042 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,042 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:37,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,044 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,044 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,044 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:37,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,046 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,046 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,048 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,048 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,050 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,050 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,052 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,052 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,054 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,054 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,056 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,056 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,057 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:37,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,060 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,061 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:19:37,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,062 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,062 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,063 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 14:19:37,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-23 14:19:37,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,063 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,064 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,064 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,066 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,066 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,069 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,070 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,070 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,072 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,073 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,073 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,074 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,075 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,075 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,077 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,078 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,078 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,079 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,079 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,080 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,082 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,082 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,082 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,087 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,087 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,088 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,088 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,090 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 14:19:37,090 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 14:19:37,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,091 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 14:19:37,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,091 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,091 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,092 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,092 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,093 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:37,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,094 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,094 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,094 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,095 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:37,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,100 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,100 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,100 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,104 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,104 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,105 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,106 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,107 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,107 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,110 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,110 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,111 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,111 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,113 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,113 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,114 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,117 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,117 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,117 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,117 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,118 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:37,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,124 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,125 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,125 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,127 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 14:19:37,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,127 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,127 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,128 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 14:19:37,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,129 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,131 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:37,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,132 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,133 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,133 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,134 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:37,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,140 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,141 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,142 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,147 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,147 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,148 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,150 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,150 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,151 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,155 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,155 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,156 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,158 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,158 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,159 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,164 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,165 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,165 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,166 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 14:19:37,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,175 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,175 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,176 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,178 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,178 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 14:19:37,179 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 14:19:37,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,180 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 14:19:37,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,180 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,180 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,181 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,181 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,181 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:37,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,183 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,184 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,184 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:37,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,187 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,188 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,191 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,193 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,193 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,193 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,194 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,196 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,196 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,196 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,198 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,198 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,199 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,199 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,201 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,201 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,202 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,202 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:19:37,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,207 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,207 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,207 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 14:19:37,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,210 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 14:19:37,210 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 14:19:37,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,211 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 14:19:37,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-23 14:19:37,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,212 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,212 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,212 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,213 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 14:19:37,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,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-23 14:19:37,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,215 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,216 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,216 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,216 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 14:19:37,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,220 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,220 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,221 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,226 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,227 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,231 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,231 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,235 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,235 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,235 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,242 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,243 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,293 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,293 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,294 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:19:37,295 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,297 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 14:19:37,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,307 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,307 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,307 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:19:37,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 14:19:37,312 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 14:19:37,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:19:37,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:19:37,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:19:37,312 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 14:19:37,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:19:37,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:19:37,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:19:37,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:19:37,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:19:37,315 INFO L87 Difference]: Start difference. First operand 258 states and 449 transitions. cyclomatic complexity: 192 Second operand 3 states. [2018-11-23 14:19:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:19:37,666 INFO L93 Difference]: Finished difference Result 430 states and 670 transitions. [2018-11-23 14:19:37,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:19:37,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 670 transitions. [2018-11-23 14:19:37,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 416 [2018-11-23 14:19:37,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 430 states and 670 transitions. [2018-11-23 14:19:37,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 430 [2018-11-23 14:19:37,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 430 [2018-11-23 14:19:37,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 430 states and 670 transitions. [2018-11-23 14:19:37,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:19:37,671 INFO L705 BuchiCegarLoop]: Abstraction has 430 states and 670 transitions. [2018-11-23 14:19:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states and 670 transitions. [2018-11-23 14:19:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 424. [2018-11-23 14:19:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-23 14:19:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 664 transitions. [2018-11-23 14:19:37,682 INFO L728 BuchiCegarLoop]: Abstraction has 424 states and 664 transitions. [2018-11-23 14:19:37,683 INFO L608 BuchiCegarLoop]: Abstraction has 424 states and 664 transitions. [2018-11-23 14:19:37,683 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:19:37,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 424 states and 664 transitions. [2018-11-23 14:19:37,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 410 [2018-11-23 14:19:37,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:19:37,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:19:37,685 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:37,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:37,686 INFO L794 eck$LassoCheckResult]: Stem: 1956#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_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; 1783#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; 1784#L1167 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 1945#L1167-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 1946#L1172-1 assume !(1 == ~m_run_pc~0); 1915#L1184 assume !(2 == ~m_run_pc~0); 1916#L1192 assume !(3 == ~m_run_pc~0); 1960#L1200 assume !(4 == ~m_run_pc~0); 1961#L1208 assume !(5 == ~m_run_pc~0); 1987#L1216 assume !(6 == ~m_run_pc~0); 1911#L1217 assume !(2 == ~s_run_pc~0); 1804#L1238 assume !(1 == ~s_run_pc~0); 1788#L1333-1 [2018-11-23 14:19:37,686 INFO L796 eck$LassoCheckResult]: Loop: 1788#L1333-1 assume !false; 2005#L1251 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; 1764#L1140 assume !false; 2033#L1115 assume !(0 == ~m_run_st~0); 2008#L1119 assume !(0 == ~s_run_st~0); 1943#L1156 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 1944#L1258 assume !(1 == ~m_run_pc~0); 1793#L1265 assume !(2 == ~m_run_pc~0); 1794#L1273 assume !(3 == ~m_run_pc~0); 1849#L1281 assume !(4 == ~m_run_pc~0); 1850#L1289 assume !(5 == ~m_run_pc~0); 1893#L1297 assume !(6 == ~m_run_pc~0); 1790#L1298 assume 2 == ~s_run_pc~0; 1792#L1313 assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 1787#L1320 assume 0 == ~m_run_st~0; 1788#L1333-1 [2018-11-23 14:19:37,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1577837401, now seen corresponding path program 1 times [2018-11-23 14:19:37,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:37,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:19:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:37,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash 738454367, now seen corresponding path program 1 times [2018-11-23 14:19:37,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:37,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:19:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:19:37,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:19:37,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:19:37,705 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 14:19:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:19:37,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:19:37,705 INFO L87 Difference]: Start difference. First operand 424 states and 664 transitions. cyclomatic complexity: 241 Second operand 3 states. [2018-11-23 14:19:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:19:37,807 INFO L93 Difference]: Finished difference Result 684 states and 1093 transitions. [2018-11-23 14:19:37,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:19:37,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 684 states and 1093 transitions. [2018-11-23 14:19:37,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 661 [2018-11-23 14:19:37,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 684 states to 684 states and 1093 transitions. [2018-11-23 14:19:37,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 684 [2018-11-23 14:19:37,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 684 [2018-11-23 14:19:37,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 684 states and 1093 transitions. [2018-11-23 14:19:37,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:19:37,816 INFO L705 BuchiCegarLoop]: Abstraction has 684 states and 1093 transitions. [2018-11-23 14:19:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states and 1093 transitions. [2018-11-23 14:19:37,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 678. [2018-11-23 14:19:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-11-23 14:19:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1087 transitions. [2018-11-23 14:19:37,828 INFO L728 BuchiCegarLoop]: Abstraction has 678 states and 1087 transitions. [2018-11-23 14:19:37,828 INFO L608 BuchiCegarLoop]: Abstraction has 678 states and 1087 transitions. [2018-11-23 14:19:37,828 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 14:19:37,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 678 states and 1087 transitions. [2018-11-23 14:19:37,831 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 655 [2018-11-23 14:19:37,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:19:37,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:19:37,831 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:37,831 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 14:19:37,831 INFO L794 eck$LassoCheckResult]: Stem: 3072#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_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; 2896#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; 2897#L1167 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 3062#L1167-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 3063#L1172-1 assume !(1 == ~m_run_pc~0); 3029#L1184 assume !(2 == ~m_run_pc~0); 3030#L1192 assume !(3 == ~m_run_pc~0); 3077#L1200 assume !(4 == ~m_run_pc~0); 3078#L1208 assume !(5 == ~m_run_pc~0); 3109#L1216 assume !(6 == ~m_run_pc~0); 3025#L1217 assume !(2 == ~s_run_pc~0); 2916#L1238 assume !(1 == ~s_run_pc~0); 2915#L1333-1 assume !false; 3497#L1251 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; 3491#L1140 [2018-11-23 14:19:37,831 INFO L796 eck$LassoCheckResult]: Loop: 3491#L1140 assume !false; 3488#L1115 assume 0 == ~m_run_st~0; 3487#L1119-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 3164#L1129 assume !(0 != eval_~tmp~0); 3165#L1125 assume !(0 == ~s_run_st~0); 3491#L1140 [2018-11-23 14:19:37,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:37,831 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 1 times [2018-11-23 14:19:37,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:37,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:37,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:37,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:37,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:37,840 INFO L82 PathProgramCache]: Analyzing trace with hash 151895569, now seen corresponding path program 1 times [2018-11-23 14:19:37,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:37,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:37,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:37,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:37,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:37,847 INFO L82 PathProgramCache]: Analyzing trace with hash -840624521, now seen corresponding path program 1 times [2018-11-23 14:19:37,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:37,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:37,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:37,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:19:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:19:37,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:19:37,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:19:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:19:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:19:37,881 INFO L87 Difference]: Start difference. First operand 678 states and 1087 transitions. cyclomatic complexity: 412 Second operand 3 states. [2018-11-23 14:19:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:19:37,959 INFO L93 Difference]: Finished difference Result 1278 states and 2046 transitions. [2018-11-23 14:19:37,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:19:37,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1278 states and 2046 transitions. [2018-11-23 14:19:37,968 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1247 [2018-11-23 14:19:37,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1278 states to 1278 states and 2046 transitions. [2018-11-23 14:19:37,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1278 [2018-11-23 14:19:37,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1278 [2018-11-23 14:19:37,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1278 states and 2046 transitions. [2018-11-23 14:19:37,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:19:37,977 INFO L705 BuchiCegarLoop]: Abstraction has 1278 states and 2046 transitions. [2018-11-23 14:19:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states and 2046 transitions. [2018-11-23 14:19:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1090. [2018-11-23 14:19:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-11-23 14:19:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1754 transitions. [2018-11-23 14:19:37,993 INFO L728 BuchiCegarLoop]: Abstraction has 1090 states and 1754 transitions. [2018-11-23 14:19:37,993 INFO L608 BuchiCegarLoop]: Abstraction has 1090 states and 1754 transitions. [2018-11-23 14:19:37,993 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 14:19:37,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1090 states and 1754 transitions. [2018-11-23 14:19:37,997 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1059 [2018-11-23 14:19:37,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:19:37,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:19:37,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:19:37,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 14:19:37,997 INFO L794 eck$LassoCheckResult]: Stem: 5038#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_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; 4860#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; 4861#L1167 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 5027#L1167-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 5028#L1172-1 assume !(1 == ~m_run_pc~0); 4994#L1184 assume !(2 == ~m_run_pc~0); 4995#L1192 assume !(3 == ~m_run_pc~0); 5046#L1200 assume !(4 == ~m_run_pc~0); 5047#L1208 assume !(5 == ~m_run_pc~0); 5076#L1216 assume !(6 == ~m_run_pc~0); 4990#L1217 assume !(2 == ~s_run_pc~0); 4885#L1238 assume !(1 == ~s_run_pc~0); 4884#L1333-1 assume !false; 5774#L1251 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; 5764#L1140 [2018-11-23 14:19:37,998 INFO L796 eck$LassoCheckResult]: Loop: 5764#L1140 assume !false; 5763#L1115 assume 0 == ~m_run_st~0; 5762#L1119-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 5734#L1129 assume !(0 != eval_~tmp~0); 5735#L1125 assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 5772#L1144 assume !(0 != eval_~tmp___0~0); 5764#L1140 [2018-11-23 14:19:37,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:37,998 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 2 times [2018-11-23 14:19:37,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:37,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:37,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:37,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:37,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:38,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:38,007 INFO L82 PathProgramCache]: Analyzing trace with hash 413786755, now seen corresponding path program 1 times [2018-11-23 14:19:38,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:38,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:38,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:19:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:38,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:19:38,011 INFO L82 PathProgramCache]: Analyzing trace with hash -289564963, now seen corresponding path program 1 times [2018-11-23 14:19:38,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:19:38,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:19:38,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:38,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:19:38,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:19:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:19:38,419 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 120 ----- 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_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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167-L1171] assume 1 == ~m_run_i~0; [L1168] ~m_run_st~0 := 0; [L1172-L1176] assume 1 == ~s_run_i~0; [L1173] ~s_run_st~0 := 0; [L1177-L1230] assume !(1 == ~m_run_pc~0); [L1185-L1229] assume !(2 == ~m_run_pc~0); [L1193-L1228] assume !(3 == ~m_run_pc~0); [L1201-L1227] assume !(4 == ~m_run_pc~0); [L1209-L1226] assume !(5 == ~m_run_pc~0); [L1217-L1225] assume !(6 == ~m_run_pc~0); [L1231-L1248] assume !(2 == ~s_run_pc~0); [L1239-L1247] assume !(1 == ~s_run_pc~0); [L1250-L1339] assume !false; [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167-L1171] assume 1 == ~m_run_i~0; [L1168] ~m_run_st~0 := 0; [L1172-L1176] assume 1 == ~s_run_i~0; [L1173] ~s_run_st~0 := 0; [L1177-L1230] assume !(1 == ~m_run_pc~0); [L1185-L1229] assume !(2 == ~m_run_pc~0); [L1193-L1228] assume !(3 == ~m_run_pc~0); [L1201-L1227] assume !(4 == ~m_run_pc~0); [L1209-L1226] assume !(5 == ~m_run_pc~0); [L1217-L1225] assume !(6 == ~m_run_pc~0); [L1231-L1248] assume !(2 == ~s_run_pc~0); [L1239-L1247] assume !(1 == ~s_run_pc~0); [L1250-L1339] assume !false; [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [L1347] havoc ~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1163] havoc ~kernel_st~0; [L1166] ~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] ~kernel_st~0 := 1; [L1109] havoc ~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [L1347] havoc ~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1163] havoc ~kernel_st~0; [L1166] ~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] ~kernel_st~0 := 1; [L1109] havoc ~tmp~0; [L1110] 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 ; [L21] int s_run_st ; [L22] int s_run_i ; [L23] int s_run_pc ; [L24] int c_m_lock ; [L25] int c_m_ev ; [L26] int c_req_type ; [L27] int c_req_a ; [L28] int c_req_d ; [L29] int c_rsp_type ; [L30] int c_rsp_status ; [L31] int c_rsp_d ; [L32] int c_empty_req ; [L33] int c_empty_rsp ; [L34] int c_read_req_ev ; [L35] int c_write_req_ev ; [L36] int c_read_rsp_ev ; [L37] int c_write_rsp_ev ; [L38] static int d_t ; [L39] static int a_t ; [L40] static int req_t_type ; [L41] static int req_t_a ; [L42] static int req_t_d ; [L43] static int rsp_t_type ; [L44] static int rsp_t_status ; [L45] static int rsp_t_d ; [L46] static int req_tt_type ; [L47] static int req_tt_a ; [L48] static int req_tt_d ; [L49] static int rsp_tt_type ; [L50] static int rsp_tt_status ; [L51] static int rsp_tt_d ; [L840] static int req_t_type___0 ; [L841] static int req_t_a___0 ; [L842] static int req_t_d___0 ; [L843] static int rsp_t_type___0 ; [L844] static int rsp_t_status___0 ; [L845] static int rsp_t_d___0 ; [L1347] int __retres1 ; [L1351] c_m_lock = 0 [L1352] c_m_ev = 2 [L1354] m_run_i = 1 [L1355] m_run_pc = 0 [L1356] s_run_i = 1 [L1357] s_run_pc = 0 [L1358] c_empty_req = 1 [L1359] c_empty_rsp = 1 [L1360] c_read_req_ev = 2 [L1361] c_write_req_ev = 2 [L1362] c_read_rsp_ev = 2 [L1363] c_write_rsp_ev = 2 [L1364] c_m_lock = 0 [L1365] c_m_ev = 2 [L1163] int kernel_st ; [L1166] kernel_st = 0 [L1167] COND TRUE (int )m_run_i == 1 [L1168] m_run_st = 0 [L1172] COND TRUE (int )s_run_i == 1 [L1173] s_run_st = 0 [L1177] COND FALSE !((int )m_run_pc == 1) [L1185] COND FALSE !((int )m_run_pc == 2) [L1193] COND FALSE !((int )m_run_pc == 3) [L1201] COND FALSE !((int )m_run_pc == 4) [L1209] COND FALSE !((int )m_run_pc == 5) [L1217] COND FALSE !((int )m_run_pc == 6) [L1231] COND FALSE !((int )s_run_pc == 2) [L1239] COND FALSE !((int )s_run_pc == 1) [L1250] COND TRUE 1 [L1253] kernel_st = 1 [L1109] int tmp ; [L1110] 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); [L1114-L1155] assume !false; [L1116-L1124] assume 0 == ~m_run_st~0; [L1125-L1139] assume 0 == ~m_run_st~0; [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] assume !(0 != eval_~tmp~0); [L1140-L1154] assume 0 == ~s_run_st~0; [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1114-L1155] assume !false; [L1116-L1124] assume 0 == ~m_run_st~0; [L1125-L1139] assume 0 == ~m_run_st~0; [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] assume !(0 != eval_~tmp~0); [L1140-L1154] assume 0 == ~s_run_st~0; [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] assume !(0 != eval_~tmp___0~0); [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] COND FALSE !(0 != eval_~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] COND FALSE !(0 != eval_~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] COND FALSE !(0 != eval_~tmp___0~0) [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] ~tmp~0 := #t~nondet1; [L1127] havoc #t~nondet1; [L1129-L1136] COND FALSE !(0 != ~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] ~tmp___0~0 := #t~nondet2; [L1142] havoc #t~nondet2; [L1144-L1151] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] ~tmp~0 := #t~nondet1; [L1127] havoc #t~nondet1; [L1129-L1136] COND FALSE !(0 != ~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] ~tmp___0~0 := #t~nondet2; [L1142] havoc #t~nondet2; [L1144-L1151] COND FALSE !(0 != ~tmp___0~0) [L1114] COND TRUE 1 [L1116] COND TRUE (int )m_run_st == 0 [L1125] COND TRUE (int )m_run_st == 0 [L1127] tmp = __VERIFIER_nondet_int() [L1129] COND FALSE !(\read(tmp)) [L1140] COND TRUE (int )s_run_st == 0 [L1142] tmp___0 = __VERIFIER_nondet_int() [L1144] COND FALSE !(\read(tmp___0)) ----- [2018-11-23 14:19:38,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:19:38 BoogieIcfgContainer [2018-11-23 14:19:38,521 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 14:19:38,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:19:38,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:19:38,522 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:19:38,522 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:19:34" (3/4) ... [2018-11-23 14:19:38,525 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_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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167-L1171] assume 1 == ~m_run_i~0; [L1168] ~m_run_st~0 := 0; [L1172-L1176] assume 1 == ~s_run_i~0; [L1173] ~s_run_st~0 := 0; [L1177-L1230] assume !(1 == ~m_run_pc~0); [L1185-L1229] assume !(2 == ~m_run_pc~0); [L1193-L1228] assume !(3 == ~m_run_pc~0); [L1201-L1227] assume !(4 == ~m_run_pc~0); [L1209-L1226] assume !(5 == ~m_run_pc~0); [L1217-L1225] assume !(6 == ~m_run_pc~0); [L1231-L1248] assume !(2 == ~s_run_pc~0); [L1239-L1247] assume !(1 == ~s_run_pc~0); [L1250-L1339] assume !false; [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167-L1171] assume 1 == ~m_run_i~0; [L1168] ~m_run_st~0 := 0; [L1172-L1176] assume 1 == ~s_run_i~0; [L1173] ~s_run_st~0 := 0; [L1177-L1230] assume !(1 == ~m_run_pc~0); [L1185-L1229] assume !(2 == ~m_run_pc~0); [L1193-L1228] assume !(3 == ~m_run_pc~0); [L1201-L1227] assume !(4 == ~m_run_pc~0); [L1209-L1226] assume !(5 == ~m_run_pc~0); [L1217-L1225] assume !(6 == ~m_run_pc~0); [L1231-L1248] assume !(2 == ~s_run_pc~0); [L1239-L1247] assume !(1 == ~s_run_pc~0); [L1250-L1339] assume !false; [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [L1347] havoc ~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1163] havoc ~kernel_st~0; [L1166] ~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] ~kernel_st~0 := 1; [L1109] havoc ~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [L1347] havoc ~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1163] havoc ~kernel_st~0; [L1166] ~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] ~kernel_st~0 := 1; [L1109] havoc ~tmp~0; [L1110] 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 ; [L21] int s_run_st ; [L22] int s_run_i ; [L23] int s_run_pc ; [L24] int c_m_lock ; [L25] int c_m_ev ; [L26] int c_req_type ; [L27] int c_req_a ; [L28] int c_req_d ; [L29] int c_rsp_type ; [L30] int c_rsp_status ; [L31] int c_rsp_d ; [L32] int c_empty_req ; [L33] int c_empty_rsp ; [L34] int c_read_req_ev ; [L35] int c_write_req_ev ; [L36] int c_read_rsp_ev ; [L37] int c_write_rsp_ev ; [L38] static int d_t ; [L39] static int a_t ; [L40] static int req_t_type ; [L41] static int req_t_a ; [L42] static int req_t_d ; [L43] static int rsp_t_type ; [L44] static int rsp_t_status ; [L45] static int rsp_t_d ; [L46] static int req_tt_type ; [L47] static int req_tt_a ; [L48] static int req_tt_d ; [L49] static int rsp_tt_type ; [L50] static int rsp_tt_status ; [L51] static int rsp_tt_d ; [L840] static int req_t_type___0 ; [L841] static int req_t_a___0 ; [L842] static int req_t_d___0 ; [L843] static int rsp_t_type___0 ; [L844] static int rsp_t_status___0 ; [L845] static int rsp_t_d___0 ; [L1347] int __retres1 ; [L1351] c_m_lock = 0 [L1352] c_m_ev = 2 [L1354] m_run_i = 1 [L1355] m_run_pc = 0 [L1356] s_run_i = 1 [L1357] s_run_pc = 0 [L1358] c_empty_req = 1 [L1359] c_empty_rsp = 1 [L1360] c_read_req_ev = 2 [L1361] c_write_req_ev = 2 [L1362] c_read_rsp_ev = 2 [L1363] c_write_rsp_ev = 2 [L1364] c_m_lock = 0 [L1365] c_m_ev = 2 [L1163] int kernel_st ; [L1166] kernel_st = 0 [L1167] COND TRUE (int )m_run_i == 1 [L1168] m_run_st = 0 [L1172] COND TRUE (int )s_run_i == 1 [L1173] s_run_st = 0 [L1177] COND FALSE !((int )m_run_pc == 1) [L1185] COND FALSE !((int )m_run_pc == 2) [L1193] COND FALSE !((int )m_run_pc == 3) [L1201] COND FALSE !((int )m_run_pc == 4) [L1209] COND FALSE !((int )m_run_pc == 5) [L1217] COND FALSE !((int )m_run_pc == 6) [L1231] COND FALSE !((int )s_run_pc == 2) [L1239] COND FALSE !((int )s_run_pc == 1) [L1250] COND TRUE 1 [L1253] kernel_st = 1 [L1109] int tmp ; [L1110] 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); [L1114-L1155] assume !false; [L1116-L1124] assume 0 == ~m_run_st~0; [L1125-L1139] assume 0 == ~m_run_st~0; [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] assume !(0 != eval_~tmp~0); [L1140-L1154] assume 0 == ~s_run_st~0; [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1114-L1155] assume !false; [L1116-L1124] assume 0 == ~m_run_st~0; [L1125-L1139] assume 0 == ~m_run_st~0; [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] assume !(0 != eval_~tmp~0); [L1140-L1154] assume 0 == ~s_run_st~0; [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] assume !(0 != eval_~tmp___0~0); [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] COND FALSE !(0 != eval_~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] COND FALSE !(0 != eval_~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] COND FALSE !(0 != eval_~tmp___0~0) [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] ~tmp~0 := #t~nondet1; [L1127] havoc #t~nondet1; [L1129-L1136] COND FALSE !(0 != ~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] ~tmp___0~0 := #t~nondet2; [L1142] havoc #t~nondet2; [L1144-L1151] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] ~tmp~0 := #t~nondet1; [L1127] havoc #t~nondet1; [L1129-L1136] COND FALSE !(0 != ~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] ~tmp___0~0 := #t~nondet2; [L1142] havoc #t~nondet2; [L1144-L1151] COND FALSE !(0 != ~tmp___0~0) [L1114] COND TRUE 1 [L1116] COND TRUE (int )m_run_st == 0 [L1125] COND TRUE (int )m_run_st == 0 [L1127] tmp = __VERIFIER_nondet_int() [L1129] COND FALSE !(\read(tmp)) [L1140] COND TRUE (int )s_run_st == 0 [L1142] tmp___0 = __VERIFIER_nondet_int() [L1144] COND FALSE !(\read(tmp___0)) ----- [2018-11-23 14:19:38,620 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a3c535e5-51ec-4181-bdb9-fac741ca7881/bin-2019/uautomizer/witness.graphml [2018-11-23 14:19:38,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:19:38,621 INFO L168 Benchmark]: Toolchain (without parser) took 4820.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 960.3 MB in the beginning and 909.7 MB in the end (delta: 50.6 MB). Peak memory consumption was 255.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:19:38,621 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:19:38,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.00 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 935.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:19:38,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 932.4 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:19:38,622 INFO L168 Benchmark]: Boogie Preprocessor took 27.35 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:19:38,626 INFO L168 Benchmark]: RCFGBuilder took 757.89 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: 84.3 MB). Peak memory consumption was 84.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:19:38,626 INFO L168 Benchmark]: BuchiAutomizer took 3522.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.0 GB in the beginning and 914.6 MB in the end (delta: 135.3 MB). Peak memory consumption was 197.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:19:38,626 INFO L168 Benchmark]: Witness Printer took 98.23 ms. Allocated memory is still 1.2 GB. Free memory was 914.6 MB in the beginning and 909.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:19:38,631 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.00 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 935.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 932.4 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.35 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 757.89 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: 84.3 MB). Peak memory consumption was 84.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3522.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.0 GB in the beginning and 914.6 MB in the end (delta: 135.3 MB). Peak memory consumption was 197.6 MB. Max. memory is 11.5 GB. * Witness Printer took 98.23 ms. Allocated memory is still 1.2 GB. Free memory was 914.6 MB in the beginning and 909.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 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 1090 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. 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, 200 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1090 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2423 SDtfs, 1836 SDslu, 990 SDs, 0 SdLazy, 285 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax100 hnf100 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf100 smp100 dnf211 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 22ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 1114]: 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, 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, req_t_d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3cba7ddb=0, c_read_req_ev=2, c_req_a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c73712f=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: 1114]: 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_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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167-L1171] assume 1 == ~m_run_i~0; [L1168] ~m_run_st~0 := 0; [L1172-L1176] assume 1 == ~s_run_i~0; [L1173] ~s_run_st~0 := 0; [L1177-L1230] assume !(1 == ~m_run_pc~0); [L1185-L1229] assume !(2 == ~m_run_pc~0); [L1193-L1228] assume !(3 == ~m_run_pc~0); [L1201-L1227] assume !(4 == ~m_run_pc~0); [L1209-L1226] assume !(5 == ~m_run_pc~0); [L1217-L1225] assume !(6 == ~m_run_pc~0); [L1231-L1248] assume !(2 == ~s_run_pc~0); [L1239-L1247] assume !(1 == ~s_run_pc~0); [L1250-L1339] assume !false; [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167-L1171] assume 1 == ~m_run_i~0; [L1168] ~m_run_st~0 := 0; [L1172-L1176] assume 1 == ~s_run_i~0; [L1173] ~s_run_st~0 := 0; [L1177-L1230] assume !(1 == ~m_run_pc~0); [L1185-L1229] assume !(2 == ~m_run_pc~0); [L1193-L1228] assume !(3 == ~m_run_pc~0); [L1201-L1227] assume !(4 == ~m_run_pc~0); [L1209-L1226] assume !(5 == ~m_run_pc~0); [L1217-L1225] assume !(6 == ~m_run_pc~0); [L1231-L1248] assume !(2 == ~s_run_pc~0); [L1239-L1247] assume !(1 == ~s_run_pc~0); [L1250-L1339] assume !false; [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [L1347] havoc ~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1163] havoc ~kernel_st~0; [L1166] ~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] ~kernel_st~0 := 1; [L1109] havoc ~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [L1347] havoc ~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1163] havoc ~kernel_st~0; [L1166] ~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] ~kernel_st~0 := 1; [L1109] havoc ~tmp~0; [L1110] 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 ; [L21] int s_run_st ; [L22] int s_run_i ; [L23] int s_run_pc ; [L24] int c_m_lock ; [L25] int c_m_ev ; [L26] int c_req_type ; [L27] int c_req_a ; [L28] int c_req_d ; [L29] int c_rsp_type ; [L30] int c_rsp_status ; [L31] int c_rsp_d ; [L32] int c_empty_req ; [L33] int c_empty_rsp ; [L34] int c_read_req_ev ; [L35] int c_write_req_ev ; [L36] int c_read_rsp_ev ; [L37] int c_write_rsp_ev ; [L38] static int d_t ; [L39] static int a_t ; [L40] static int req_t_type ; [L41] static int req_t_a ; [L42] static int req_t_d ; [L43] static int rsp_t_type ; [L44] static int rsp_t_status ; [L45] static int rsp_t_d ; [L46] static int req_tt_type ; [L47] static int req_tt_a ; [L48] static int req_tt_d ; [L49] static int rsp_tt_type ; [L50] static int rsp_tt_status ; [L51] static int rsp_tt_d ; [L840] static int req_t_type___0 ; [L841] static int req_t_a___0 ; [L842] static int req_t_d___0 ; [L843] static int rsp_t_type___0 ; [L844] static int rsp_t_status___0 ; [L845] static int rsp_t_d___0 ; [L1347] int __retres1 ; [L1351] c_m_lock = 0 [L1352] c_m_ev = 2 [L1354] m_run_i = 1 [L1355] m_run_pc = 0 [L1356] s_run_i = 1 [L1357] s_run_pc = 0 [L1358] c_empty_req = 1 [L1359] c_empty_rsp = 1 [L1360] c_read_req_ev = 2 [L1361] c_write_req_ev = 2 [L1362] c_read_rsp_ev = 2 [L1363] c_write_rsp_ev = 2 [L1364] c_m_lock = 0 [L1365] c_m_ev = 2 [L1163] int kernel_st ; [L1166] kernel_st = 0 [L1167] COND TRUE (int )m_run_i == 1 [L1168] m_run_st = 0 [L1172] COND TRUE (int )s_run_i == 1 [L1173] s_run_st = 0 [L1177] COND FALSE !((int )m_run_pc == 1) [L1185] COND FALSE !((int )m_run_pc == 2) [L1193] COND FALSE !((int )m_run_pc == 3) [L1201] COND FALSE !((int )m_run_pc == 4) [L1209] COND FALSE !((int )m_run_pc == 5) [L1217] COND FALSE !((int )m_run_pc == 6) [L1231] COND FALSE !((int )s_run_pc == 2) [L1239] COND FALSE !((int )s_run_pc == 1) [L1250] COND TRUE 1 [L1253] kernel_st = 1 [L1109] int tmp ; [L1110] 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); [L1114-L1155] assume !false; [L1116-L1124] assume 0 == ~m_run_st~0; [L1125-L1139] assume 0 == ~m_run_st~0; [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] assume !(0 != eval_~tmp~0); [L1140-L1154] assume 0 == ~s_run_st~0; [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1114-L1155] assume !false; [L1116-L1124] assume 0 == ~m_run_st~0; [L1125-L1139] assume 0 == ~m_run_st~0; [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] assume !(0 != eval_~tmp~0); [L1140-L1154] assume 0 == ~s_run_st~0; [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] assume !(0 != eval_~tmp___0~0); [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] COND FALSE !(0 != eval_~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] COND FALSE !(0 != eval_~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] COND FALSE !(0 != eval_~tmp___0~0) [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] ~tmp~0 := #t~nondet1; [L1127] havoc #t~nondet1; [L1129-L1136] COND FALSE !(0 != ~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] ~tmp___0~0 := #t~nondet2; [L1142] havoc #t~nondet2; [L1144-L1151] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] ~tmp~0 := #t~nondet1; [L1127] havoc #t~nondet1; [L1129-L1136] COND FALSE !(0 != ~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] ~tmp___0~0 := #t~nondet2; [L1142] havoc #t~nondet2; [L1144-L1151] COND FALSE !(0 != ~tmp___0~0) [L1114] COND TRUE 1 [L1116] COND TRUE (int )m_run_st == 0 [L1125] COND TRUE (int )m_run_st == 0 [L1127] tmp = __VERIFIER_nondet_int() [L1129] COND FALSE !(\read(tmp)) [L1140] COND TRUE (int )s_run_st == 0 [L1142] tmp___0 = __VERIFIER_nondet_int() [L1144] 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_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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167-L1171] assume 1 == ~m_run_i~0; [L1168] ~m_run_st~0 := 0; [L1172-L1176] assume 1 == ~s_run_i~0; [L1173] ~s_run_st~0 := 0; [L1177-L1230] assume !(1 == ~m_run_pc~0); [L1185-L1229] assume !(2 == ~m_run_pc~0); [L1193-L1228] assume !(3 == ~m_run_pc~0); [L1201-L1227] assume !(4 == ~m_run_pc~0); [L1209-L1226] assume !(5 == ~m_run_pc~0); [L1217-L1225] assume !(6 == ~m_run_pc~0); [L1231-L1248] assume !(2 == ~s_run_pc~0); [L1239-L1247] assume !(1 == ~s_run_pc~0); [L1250-L1339] assume !false; [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167-L1171] assume 1 == ~m_run_i~0; [L1168] ~m_run_st~0 := 0; [L1172-L1176] assume 1 == ~s_run_i~0; [L1173] ~s_run_st~0 := 0; [L1177-L1230] assume !(1 == ~m_run_pc~0); [L1185-L1229] assume !(2 == ~m_run_pc~0); [L1193-L1228] assume !(3 == ~m_run_pc~0); [L1201-L1227] assume !(4 == ~m_run_pc~0); [L1209-L1226] assume !(5 == ~m_run_pc~0); [L1217-L1225] assume !(6 == ~m_run_pc~0); [L1231-L1248] assume !(2 == ~s_run_pc~0); [L1239-L1247] assume !(1 == ~s_run_pc~0); [L1250-L1339] assume !false; [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1347] havoc main_~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1366] havoc start_simulation_~kernel_st~0; [L1163] havoc start_simulation_~kernel_st~0; [L1166] start_simulation_~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] start_simulation_~kernel_st~0 := 1; [L1254] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1109] havoc eval_~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [L1347] havoc ~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1163] havoc ~kernel_st~0; [L1166] ~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] ~kernel_st~0 := 1; [L1109] havoc ~tmp~0; [L1110] 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; [L21] ~s_run_st~0 := 0; [L22] ~s_run_i~0 := 0; [L23] ~s_run_pc~0 := 0; [L24] ~c_m_lock~0 := 0; [L25] ~c_m_ev~0 := 0; [L26] ~c_req_type~0 := 0; [L27] ~c_req_a~0 := 0; [L28] ~c_req_d~0 := 0; [L29] ~c_rsp_type~0 := 0; [L30] ~c_rsp_status~0 := 0; [L31] ~c_rsp_d~0 := 0; [L32] ~c_empty_req~0 := 0; [L33] ~c_empty_rsp~0 := 0; [L34] ~c_read_req_ev~0 := 0; [L35] ~c_write_req_ev~0 := 0; [L36] ~c_read_rsp_ev~0 := 0; [L37] ~c_write_rsp_ev~0 := 0; [L38] ~d_t~0 := 0; [L39] ~a_t~0 := 0; [L40] ~req_t_type~0 := 0; [L41] ~req_t_a~0 := 0; [L42] ~req_t_d~0 := 0; [L43] ~rsp_t_type~0 := 0; [L44] ~rsp_t_status~0 := 0; [L45] ~rsp_t_d~0 := 0; [L46] ~req_tt_type~0 := 0; [L47] ~req_tt_a~0 := 0; [L48] ~req_tt_d~0 := 0; [L49] ~rsp_tt_type~0 := 0; [L50] ~rsp_tt_status~0 := 0; [L51] ~rsp_tt_d~0 := 0; [L840] ~req_t_type___0~0 := 0; [L841] ~req_t_a___0~0 := 0; [L842] ~req_t_d___0~0 := 0; [L843] ~rsp_t_type___0~0 := 0; [L844] ~rsp_t_status___0~0 := 0; [L845] ~rsp_t_d___0~0 := 0; [L1347] havoc ~__retres1~0; [L1351] ~c_m_lock~0 := 0; [L1352] ~c_m_ev~0 := 2; [L1354] ~m_run_i~0 := 1; [L1355] ~m_run_pc~0 := 0; [L1356] ~s_run_i~0 := 1; [L1357] ~s_run_pc~0 := 0; [L1358] ~c_empty_req~0 := 1; [L1359] ~c_empty_rsp~0 := 1; [L1360] ~c_read_req_ev~0 := 2; [L1361] ~c_write_req_ev~0 := 2; [L1362] ~c_read_rsp_ev~0 := 2; [L1363] ~c_write_rsp_ev~0 := 2; [L1364] ~c_m_lock~0 := 0; [L1365] ~c_m_ev~0 := 2; [L1163] havoc ~kernel_st~0; [L1166] ~kernel_st~0 := 0; [L1167] COND TRUE 1 == ~m_run_i~0 [L1168] ~m_run_st~0 := 0; [L1172] COND TRUE 1 == ~s_run_i~0 [L1173] ~s_run_st~0 := 0; [L1177] COND FALSE !(1 == ~m_run_pc~0) [L1185] COND FALSE !(2 == ~m_run_pc~0) [L1193] COND FALSE !(3 == ~m_run_pc~0) [L1201] COND FALSE !(4 == ~m_run_pc~0) [L1209] COND FALSE !(5 == ~m_run_pc~0) [L1217] COND FALSE !(6 == ~m_run_pc~0) [L1231] COND FALSE !(2 == ~s_run_pc~0) [L1239] COND FALSE !(1 == ~s_run_pc~0) [L1250-L1339] COND FALSE !(false) [L1253] ~kernel_st~0 := 1; [L1109] havoc ~tmp~0; [L1110] 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 ; [L21] int s_run_st ; [L22] int s_run_i ; [L23] int s_run_pc ; [L24] int c_m_lock ; [L25] int c_m_ev ; [L26] int c_req_type ; [L27] int c_req_a ; [L28] int c_req_d ; [L29] int c_rsp_type ; [L30] int c_rsp_status ; [L31] int c_rsp_d ; [L32] int c_empty_req ; [L33] int c_empty_rsp ; [L34] int c_read_req_ev ; [L35] int c_write_req_ev ; [L36] int c_read_rsp_ev ; [L37] int c_write_rsp_ev ; [L38] static int d_t ; [L39] static int a_t ; [L40] static int req_t_type ; [L41] static int req_t_a ; [L42] static int req_t_d ; [L43] static int rsp_t_type ; [L44] static int rsp_t_status ; [L45] static int rsp_t_d ; [L46] static int req_tt_type ; [L47] static int req_tt_a ; [L48] static int req_tt_d ; [L49] static int rsp_tt_type ; [L50] static int rsp_tt_status ; [L51] static int rsp_tt_d ; [L840] static int req_t_type___0 ; [L841] static int req_t_a___0 ; [L842] static int req_t_d___0 ; [L843] static int rsp_t_type___0 ; [L844] static int rsp_t_status___0 ; [L845] static int rsp_t_d___0 ; [L1347] int __retres1 ; [L1351] c_m_lock = 0 [L1352] c_m_ev = 2 [L1354] m_run_i = 1 [L1355] m_run_pc = 0 [L1356] s_run_i = 1 [L1357] s_run_pc = 0 [L1358] c_empty_req = 1 [L1359] c_empty_rsp = 1 [L1360] c_read_req_ev = 2 [L1361] c_write_req_ev = 2 [L1362] c_read_rsp_ev = 2 [L1363] c_write_rsp_ev = 2 [L1364] c_m_lock = 0 [L1365] c_m_ev = 2 [L1163] int kernel_st ; [L1166] kernel_st = 0 [L1167] COND TRUE (int )m_run_i == 1 [L1168] m_run_st = 0 [L1172] COND TRUE (int )s_run_i == 1 [L1173] s_run_st = 0 [L1177] COND FALSE !((int )m_run_pc == 1) [L1185] COND FALSE !((int )m_run_pc == 2) [L1193] COND FALSE !((int )m_run_pc == 3) [L1201] COND FALSE !((int )m_run_pc == 4) [L1209] COND FALSE !((int )m_run_pc == 5) [L1217] COND FALSE !((int )m_run_pc == 6) [L1231] COND FALSE !((int )s_run_pc == 2) [L1239] COND FALSE !((int )s_run_pc == 1) [L1250] COND TRUE 1 [L1253] kernel_st = 1 [L1109] int tmp ; [L1110] 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); [L1114-L1155] assume !false; [L1116-L1124] assume 0 == ~m_run_st~0; [L1125-L1139] assume 0 == ~m_run_st~0; [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] assume !(0 != eval_~tmp~0); [L1140-L1154] assume 0 == ~s_run_st~0; [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1114-L1155] assume !false; [L1116-L1124] assume 0 == ~m_run_st~0; [L1125-L1139] assume 0 == ~m_run_st~0; [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] assume !(0 != eval_~tmp~0); [L1140-L1154] assume 0 == ~s_run_st~0; [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] assume !(0 != eval_~tmp___0~0); [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] COND FALSE !(0 != eval_~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] eval_~tmp~0 := eval_#t~nondet1; [L1127] havoc eval_#t~nondet1; [L1129-L1136] COND FALSE !(0 != eval_~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] eval_~tmp___0~0 := eval_#t~nondet2; [L1142] havoc eval_#t~nondet2; [L1144-L1151] COND FALSE !(0 != eval_~tmp___0~0) [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] ~tmp~0 := #t~nondet1; [L1127] havoc #t~nondet1; [L1129-L1136] COND FALSE !(0 != ~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] ~tmp___0~0 := #t~nondet2; [L1142] havoc #t~nondet2; [L1144-L1151] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1114-L1155] COND FALSE !(false) [L1116] COND TRUE 0 == ~m_run_st~0 [L1125] COND TRUE 0 == ~m_run_st~0 [L1127] ~tmp~0 := #t~nondet1; [L1127] havoc #t~nondet1; [L1129-L1136] COND FALSE !(0 != ~tmp~0) [L1140] COND TRUE 0 == ~s_run_st~0 [L1142] ~tmp___0~0 := #t~nondet2; [L1142] havoc #t~nondet2; [L1144-L1151] COND FALSE !(0 != ~tmp___0~0) [L1114] COND TRUE 1 [L1116] COND TRUE (int )m_run_st == 0 [L1125] COND TRUE (int )m_run_st == 0 [L1127] tmp = __VERIFIER_nondet_int() [L1129] COND FALSE !(\read(tmp)) [L1140] COND TRUE (int )s_run_st == 0 [L1142] tmp___0 = __VERIFIER_nondet_int() [L1144] 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 ; [L21] int s_run_st ; [L22] int s_run_i ; [L23] int s_run_pc ; [L24] int c_m_lock ; [L25] int c_m_ev ; [L26] int c_req_type ; [L27] int c_req_a ; [L28] int c_req_d ; [L29] int c_rsp_type ; [L30] int c_rsp_status ; [L31] int c_rsp_d ; [L32] int c_empty_req ; [L33] int c_empty_rsp ; [L34] int c_read_req_ev ; [L35] int c_write_req_ev ; [L36] int c_read_rsp_ev ; [L37] int c_write_rsp_ev ; [L38] static int d_t ; [L39] static int a_t ; [L40] static int req_t_type ; [L41] static int req_t_a ; [L42] static int req_t_d ; [L43] static int rsp_t_type ; [L44] static int rsp_t_status ; [L45] static int rsp_t_d ; [L46] static int req_tt_type ; [L47] static int req_tt_a ; [L48] static int req_tt_d ; [L49] static int rsp_tt_type ; [L50] static int rsp_tt_status ; [L51] static int rsp_tt_d ; [L840] static int req_t_type___0 ; [L841] static int req_t_a___0 ; [L842] static int req_t_d___0 ; [L843] static int rsp_t_type___0 ; [L844] static int rsp_t_status___0 ; [L845] static int rsp_t_d___0 ; [L1347] int __retres1 ; [L1351] c_m_lock = 0 [L1352] c_m_ev = 2 [L1354] m_run_i = 1 [L1355] m_run_pc = 0 [L1356] s_run_i = 1 [L1357] s_run_pc = 0 [L1358] c_empty_req = 1 [L1359] c_empty_rsp = 1 [L1360] c_read_req_ev = 2 [L1361] c_write_req_ev = 2 [L1362] c_read_rsp_ev = 2 [L1363] c_write_rsp_ev = 2 [L1364] c_m_lock = 0 [L1365] c_m_ev = 2 [L1163] int kernel_st ; [L1166] kernel_st = 0 [L1167] COND TRUE (int )m_run_i == 1 [L1168] m_run_st = 0 [L1172] COND TRUE (int )s_run_i == 1 [L1173] s_run_st = 0 [L1177] COND FALSE !((int )m_run_pc == 1) [L1185] COND FALSE !((int )m_run_pc == 2) [L1193] COND FALSE !((int )m_run_pc == 3) [L1201] COND FALSE !((int )m_run_pc == 4) [L1209] COND FALSE !((int )m_run_pc == 5) [L1217] COND FALSE !((int )m_run_pc == 6) [L1231] COND FALSE !((int )s_run_pc == 2) [L1239] COND FALSE !((int )s_run_pc == 1) [L1250] COND TRUE 1 [L1253] kernel_st = 1 [L1109] int tmp ; [L1110] int tmp___0 ; Loop: [L1114] COND TRUE 1 [L1116] COND TRUE (int )m_run_st == 0 [L1125] COND TRUE (int )m_run_st == 0 [L1127] tmp = __VERIFIER_nondet_int() [L1129] COND FALSE !(\read(tmp)) [L1140] COND TRUE (int )s_run_st == 0 [L1142] tmp___0 = __VERIFIER_nondet_int() [L1144] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...