./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu_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_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 375118f5e6b201fc35ff4858369e05c815397841 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:52:04,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:52:04,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:52:04,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:52:04,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:52:04,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:52:04,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:52:04,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:52:04,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:52:04,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:52:04,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:52:04,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:52:04,809 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:52:04,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:52:04,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:52:04,811 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:52:04,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:52:04,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:52:04,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:52:04,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:52:04,816 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:52:04,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:52:04,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:52:04,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:52:04,819 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:52:04,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:52:04,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:52:04,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:52:04,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:52:04,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:52:04,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:52:04,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:52:04,823 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:52:04,823 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:52:04,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:52:04,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:52:04,825 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 00:52:04,836 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:52:04,836 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:52:04,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:52:04,837 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:52:04,837 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:52:04,837 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 00:52:04,837 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 00:52:04,837 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 00:52:04,838 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 00:52:04,838 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 00:52:04,838 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 00:52:04,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:52:04,838 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:52:04,838 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:52:04,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:52:04,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:52:04,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:52:04,839 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 00:52:04,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 00:52:04,839 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 00:52:04,839 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:52:04,839 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:52:04,840 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 00:52:04,840 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:52:04,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 00:52:04,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:52:04,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:52:04,840 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 00:52:04,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:52:04,840 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:52:04,841 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 00:52:04,841 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 00:52:04,841 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_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 -> 375118f5e6b201fc35ff4858369e05c815397841 [2018-11-23 00:52:04,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:52:04,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:52:04,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:52:04,877 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:52:04,878 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:52:04,878 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-11-23 00:52:04,927 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/data/34c143728/b4f568202f184a8bb4c8d38d2e69fe07/FLAG00a3261d6 [2018-11-23 00:52:05,295 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:52:05,296 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-11-23 00:52:05,304 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/data/34c143728/b4f568202f184a8bb4c8d38d2e69fe07/FLAG00a3261d6 [2018-11-23 00:52:05,688 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/data/34c143728/b4f568202f184a8bb4c8d38d2e69fe07 [2018-11-23 00:52:05,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:52:05,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:52:05,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:52:05,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:52:05,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:52:05,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:05,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e873bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05, skipping insertion in model container [2018-11-23 00:52:05,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:05,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:52:05,730 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:52:05,892 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:52:05,896 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:52:05,929 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:52:05,943 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:52:05,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05 WrapperNode [2018-11-23 00:52:05,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:52:05,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:52:05,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:52:05,944 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:52:05,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:05,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:06,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:52:06,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:52:06,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:52:06,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:52:06,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:06,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:06,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:06,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:06,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:06,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:06,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... [2018-11-23 00:52:06,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:52:06,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:52:06,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:52:06,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:52:06,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:52:06,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:52:06,526 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:52:06,527 INFO L280 CfgBuilder]: Removed 95 assue(true) statements. [2018-11-23 00:52:06,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:06 BoogieIcfgContainer [2018-11-23 00:52:06,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:52:06,528 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 00:52:06,528 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 00:52:06,530 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 00:52:06,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:52:06,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:52:05" (1/3) ... [2018-11-23 00:52:06,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4535984b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:52:06, skipping insertion in model container [2018-11-23 00:52:06,532 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:52:06,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:05" (2/3) ... [2018-11-23 00:52:06,532 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4535984b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:52:06, skipping insertion in model container [2018-11-23 00:52:06,532 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:52:06,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:06" (3/3) ... [2018-11-23 00:52:06,533 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu_true-unreach-call_false-termination.cil.c [2018-11-23 00:52:06,568 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:52:06,568 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 00:52:06,569 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 00:52:06,569 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 00:52:06,569 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:52:06,569 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:52:06,569 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 00:52:06,569 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:52:06,569 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 00:52:06,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states. [2018-11-23 00:52:06,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2018-11-23 00:52:06,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:06,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:06,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:06,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:06,615 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 00:52:06,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states. [2018-11-23 00:52:06,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2018-11-23 00:52:06,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:06,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:06,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:06,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:06,628 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRYtrue ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 12#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 101#L603true havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 18#L288true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 76#L295-1true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 117#L300-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 143#L305-1true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 86#L108true assume !(1 == ~P_1_pc~0); 80#L108-2true is_P_1_triggered_~__retres1~0 := 0; 87#L119true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 31#L120true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 154#L481true assume !(0 != activate_threads_~tmp~1); 159#L481-2true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 109#L176true assume 1 == ~P_2_pc~0; 53#L177true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 110#L187true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 54#L188true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 161#L489true assume !(0 != activate_threads_~tmp___0~1); 170#L489-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 173#L258true assume 1 == ~C_1_pc~0; 102#L259true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 68#L279true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 177#L280true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 29#L497true assume !(0 != activate_threads_~tmp___1~1); 88#L551-1true [2018-11-23 00:52:06,628 INFO L796 eck$LassoCheckResult]: Loop: 88#L551-1true assume !false; 20#L552true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 5#L387true assume !true; 42#L403true start_simulation_~kernel_st~0 := 2; 13#L288-1true start_simulation_~kernel_st~0 := 3; 41#L414true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 51#L108-6true assume 1 == ~P_1_pc~0; 21#L109-2true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 83#L119-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 23#L120-2true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 142#L481-6true assume !(0 != activate_threads_~tmp~1); 124#L481-8true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 115#L176-6true assume 1 == ~P_2_pc~0; 47#L177-2true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 123#L187-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 48#L188-2true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 149#L489-6true assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 155#L489-8true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 127#L258-6true assume 1 == ~C_1_pc~0; 97#L259-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 63#L279-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 169#L280-2true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 9#L497-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 162#L497-8true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 24#L318-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 148#L335-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 106#L336-1true start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 105#L570true assume !(0 == start_simulation_~tmp~3); 90#L570-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 28#L318-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 151#L335-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 91#L336-2true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 152#L525true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 62#L532true stop_simulation_#res := stop_simulation_~__retres2~0; 10#L533true start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 139#L583true assume !(0 != start_simulation_~tmp___0~2); 88#L551-1true [2018-11-23 00:52:06,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2018-11-23 00:52:06,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:06,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:06,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:06,729 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 00:52:06,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:06,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:06,735 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:52:06,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash 369732879, now seen corresponding path program 1 times [2018-11-23 00:52:06,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:06,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:06,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:06,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:06,746 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 00:52:06,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:06,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:52:06,747 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:06,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:06,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:06,759 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 3 states. [2018-11-23 00:52:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:06,790 INFO L93 Difference]: Finished difference Result 176 states and 259 transitions. [2018-11-23 00:52:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:06,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 259 transitions. [2018-11-23 00:52:06,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-11-23 00:52:06,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 168 states and 251 transitions. [2018-11-23 00:52:06,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-11-23 00:52:06,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-11-23 00:52:06,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 251 transitions. [2018-11-23 00:52:06,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:06,806 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2018-11-23 00:52:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 251 transitions. [2018-11-23 00:52:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-11-23 00:52:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 00:52:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2018-11-23 00:52:06,834 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2018-11-23 00:52:06,834 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2018-11-23 00:52:06,834 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 00:52:06,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 251 transitions. [2018-11-23 00:52:06,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-11-23 00:52:06,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:06,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:06,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:06,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:06,838 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 381#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 382#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 397#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 398#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 477#L300-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 504#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 483#L108 assume !(1 == ~P_1_pc~0); 421#L108-2 is_P_1_triggered_~__retres1~0 := 0; 420#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 422#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 423#L481 assume !(0 != activate_threads_~tmp~1); 523#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 501#L176 assume 1 == ~P_2_pc~0; 453#L177 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 454#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 456#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 457#L489 assume !(0 != activate_threads_~tmp___0~1); 525#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 529#L258 assume 1 == ~C_1_pc~0; 495#L259 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 464#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 467#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 417#L497 assume !(0 != activate_threads_~tmp___1~1); 418#L551-1 [2018-11-23 00:52:06,838 INFO L796 eck$LassoCheckResult]: Loop: 418#L551-1 assume !false; 400#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 366#L387 assume !false; 367#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 392#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 393#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 497#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 498#L352 assume !(0 != eval_~tmp___2~0); 438#L403 start_simulation_~kernel_st~0 := 2; 383#L288-1 start_simulation_~kernel_st~0 := 3; 384#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 437#L108-6 assume 1 == ~P_1_pc~0; 401#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 402#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 404#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 405#L481-6 assume !(0 != activate_threads_~tmp~1); 508#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 502#L176-6 assume 1 == ~P_2_pc~0; 443#L177-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 444#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 446#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 447#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 522#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 511#L258-6 assume 1 == ~C_1_pc~0; 490#L259-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 432#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 462#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 374#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 375#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 406#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 407#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 500#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 499#L570 assume !(0 == start_simulation_~tmp~3); 436#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 414#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 415#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 484#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 485#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 461#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 376#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 377#L583 assume !(0 != start_simulation_~tmp___0~2); 418#L551-1 [2018-11-23 00:52:06,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:06,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2018-11-23 00:52:06,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:06,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:06,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:06,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:06,861 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 00:52:06,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:06,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:06,861 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:52:06,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:06,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1403144407, now seen corresponding path program 1 times [2018-11-23 00:52:06,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:06,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:06,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:06,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:06,919 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 00:52:06,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:06,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:52:06,919 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:06,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:06,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:06,920 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-11-23 00:52:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:06,933 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2018-11-23 00:52:06,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:06,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 250 transitions. [2018-11-23 00:52:06,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-11-23 00:52:06,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 250 transitions. [2018-11-23 00:52:06,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-11-23 00:52:06,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-11-23 00:52:06,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 250 transitions. [2018-11-23 00:52:06,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:06,939 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2018-11-23 00:52:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 250 transitions. [2018-11-23 00:52:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-11-23 00:52:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 00:52:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2018-11-23 00:52:06,946 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2018-11-23 00:52:06,946 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2018-11-23 00:52:06,946 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 00:52:06,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 250 transitions. [2018-11-23 00:52:06,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-11-23 00:52:06,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:06,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:06,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:06,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:06,948 INFO L794 eck$LassoCheckResult]: Stem: 848#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 726#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 727#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 740#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 741#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 822#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 849#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 828#L108 assume !(1 == ~P_1_pc~0); 766#L108-2 is_P_1_triggered_~__retres1~0 := 0; 765#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 767#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 768#L481 assume !(0 != activate_threads_~tmp~1); 868#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 846#L176 assume 1 == ~P_2_pc~0; 798#L177 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 799#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 801#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 802#L489 assume !(0 != activate_threads_~tmp___0~1); 870#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 874#L258 assume 1 == ~C_1_pc~0; 840#L259 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 809#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 812#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 762#L497 assume !(0 != activate_threads_~tmp___1~1); 763#L551-1 [2018-11-23 00:52:06,949 INFO L796 eck$LassoCheckResult]: Loop: 763#L551-1 assume !false; 744#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 711#L387 assume !false; 712#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 735#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 736#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 842#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 843#L352 assume !(0 != eval_~tmp___2~0); 783#L403 start_simulation_~kernel_st~0 := 2; 728#L288-1 start_simulation_~kernel_st~0 := 3; 729#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 782#L108-6 assume 1 == ~P_1_pc~0; 745#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 746#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 749#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 750#L481-6 assume !(0 != activate_threads_~tmp~1); 853#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 847#L176-6 assume 1 == ~P_2_pc~0; 788#L177-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 789#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 791#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 792#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 867#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 856#L258-6 assume 1 == ~C_1_pc~0; 835#L259-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 777#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 807#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 719#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 720#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 751#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 752#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 845#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 844#L570 assume !(0 == start_simulation_~tmp~3); 781#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 759#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 760#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 829#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 830#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 806#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 721#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 722#L583 assume !(0 != start_simulation_~tmp___0~2); 763#L551-1 [2018-11-23 00:52:06,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:06,949 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2018-11-23 00:52:06,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:06,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:06,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:06,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:06,977 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 00:52:06,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:06,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:06,978 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:52:06,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1403144407, now seen corresponding path program 2 times [2018-11-23 00:52:06,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:06,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:06,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:06,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:07,008 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 00:52:07,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:07,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:52:07,009 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:07,009 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-11-23 00:52:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:07,057 INFO L93 Difference]: Finished difference Result 303 states and 446 transitions. [2018-11-23 00:52:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:07,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 446 transitions. [2018-11-23 00:52:07,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 275 [2018-11-23 00:52:07,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 303 states and 446 transitions. [2018-11-23 00:52:07,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 303 [2018-11-23 00:52:07,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2018-11-23 00:52:07,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 446 transitions. [2018-11-23 00:52:07,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:07,063 INFO L705 BuchiCegarLoop]: Abstraction has 303 states and 446 transitions. [2018-11-23 00:52:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 446 transitions. [2018-11-23 00:52:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2018-11-23 00:52:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-23 00:52:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 425 transitions. [2018-11-23 00:52:07,073 INFO L728 BuchiCegarLoop]: Abstraction has 288 states and 425 transitions. [2018-11-23 00:52:07,073 INFO L608 BuchiCegarLoop]: Abstraction has 288 states and 425 transitions. [2018-11-23 00:52:07,073 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 00:52:07,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 425 transitions. [2018-11-23 00:52:07,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 260 [2018-11-23 00:52:07,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:07,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:07,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,076 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,076 INFO L794 eck$LassoCheckResult]: Stem: 1331#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1206#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1207#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1220#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1221#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1299#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1332#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1305#L108 assume !(1 == ~P_1_pc~0); 1246#L108-2 is_P_1_triggered_~__retres1~0 := 0; 1245#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1247#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1248#L481 assume !(0 != activate_threads_~tmp~1); 1352#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1327#L176 assume !(1 == ~P_2_pc~0); 1328#L176-2 is_P_2_triggered_~__retres1~1 := 0; 1329#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1278#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1279#L489 assume !(0 != activate_threads_~tmp___0~1); 1354#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1358#L258 assume 1 == ~C_1_pc~0; 1321#L259 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1286#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1289#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1242#L497 assume !(0 != activate_threads_~tmp___1~1); 1243#L551-1 [2018-11-23 00:52:07,076 INFO L796 eck$LassoCheckResult]: Loop: 1243#L551-1 assume !false; 1228#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1191#L387 assume !false; 1192#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1217#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1218#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1323#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1324#L352 assume !(0 != eval_~tmp___2~0); 1263#L403 start_simulation_~kernel_st~0 := 2; 1208#L288-1 start_simulation_~kernel_st~0 := 3; 1209#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1262#L108-6 assume 1 == ~P_1_pc~0; 1225#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 1226#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1232#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1233#L481-6 assume !(0 != activate_threads_~tmp~1); 1336#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1330#L176-6 assume !(1 == ~P_2_pc~0); 1312#L176-8 is_P_2_triggered_~__retres1~1 := 0; 1313#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1271#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1272#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 1351#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1339#L258-6 assume 1 == ~C_1_pc~0; 1316#L259-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1257#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1284#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1199#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1200#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1229#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1230#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1326#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1325#L570 assume !(0 == start_simulation_~tmp~3); 1261#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1237#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1238#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1306#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1307#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1283#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 1201#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1202#L583 assume !(0 != start_simulation_~tmp___0~2); 1243#L551-1 [2018-11-23 00:52:07,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2018-11-23 00:52:07,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:52:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:07,099 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 00:52:07,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:07,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:07,100 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:52:07,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1301427912, now seen corresponding path program 1 times [2018-11-23 00:52:07,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:07,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:07,121 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 00:52:07,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:07,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:52:07,122 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:07,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:07,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:07,122 INFO L87 Difference]: Start difference. First operand 288 states and 425 transitions. cyclomatic complexity: 138 Second operand 3 states. [2018-11-23 00:52:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:07,189 INFO L93 Difference]: Finished difference Result 536 states and 772 transitions. [2018-11-23 00:52:07,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:07,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 536 states and 772 transitions. [2018-11-23 00:52:07,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 510 [2018-11-23 00:52:07,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 536 states to 536 states and 772 transitions. [2018-11-23 00:52:07,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2018-11-23 00:52:07,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2018-11-23 00:52:07,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 772 transitions. [2018-11-23 00:52:07,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:07,199 INFO L705 BuchiCegarLoop]: Abstraction has 536 states and 772 transitions. [2018-11-23 00:52:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 772 transitions. [2018-11-23 00:52:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 520. [2018-11-23 00:52:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-23 00:52:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 752 transitions. [2018-11-23 00:52:07,212 INFO L728 BuchiCegarLoop]: Abstraction has 520 states and 752 transitions. [2018-11-23 00:52:07,213 INFO L608 BuchiCegarLoop]: Abstraction has 520 states and 752 transitions. [2018-11-23 00:52:07,213 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 00:52:07,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 520 states and 752 transitions. [2018-11-23 00:52:07,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 494 [2018-11-23 00:52:07,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:07,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:07,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,217 INFO L794 eck$LassoCheckResult]: Stem: 2167#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2039#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2040#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 2053#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2054#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2132#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2168#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2141#L108 assume !(1 == ~P_1_pc~0); 2079#L108-2 is_P_1_triggered_~__retres1~0 := 0; 2078#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2080#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2081#L481 assume !(0 != activate_threads_~tmp~1); 2193#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2162#L176 assume !(1 == ~P_2_pc~0); 2163#L176-2 is_P_2_triggered_~__retres1~1 := 0; 2164#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2111#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2112#L489 assume !(0 != activate_threads_~tmp___0~1); 2199#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2206#L258 assume !(1 == ~C_1_pc~0); 2202#L258-2 assume !(2 == ~C_1_pc~0); 2118#L268-1 is_C_1_triggered_~__retres1~2 := 0; 2119#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2122#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2075#L497 assume !(0 != activate_threads_~tmp___1~1); 2076#L551-1 [2018-11-23 00:52:07,217 INFO L796 eck$LassoCheckResult]: Loop: 2076#L551-1 assume !false; 2307#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2303#L387 assume !false; 2298#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2295#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2292#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2287#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2281#L352 assume !(0 != eval_~tmp___2~0); 2096#L403 start_simulation_~kernel_st~0 := 2; 2041#L288-1 start_simulation_~kernel_st~0 := 3; 2042#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2095#L108-6 assume 1 == ~P_1_pc~0; 2058#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 2059#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2062#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2063#L481-6 assume !(0 != activate_threads_~tmp~1); 2172#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2165#L176-6 assume !(1 == ~P_2_pc~0); 2166#L176-8 is_P_2_triggered_~__retres1~1 := 0; 2436#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2434#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2432#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 2429#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2427#L258-6 assume !(1 == ~C_1_pc~0); 2425#L258-8 assume !(2 == ~C_1_pc~0); 2423#L268-5 is_C_1_triggered_~__retres1~2 := 0; 2421#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2419#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2416#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 2414#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2410#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2406#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2404#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2389#L570 assume !(0 == start_simulation_~tmp~3); 2382#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2340#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2335#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2334#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2329#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2327#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 2323#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 2320#L583 assume !(0 != start_simulation_~tmp___0~2); 2076#L551-1 [2018-11-23 00:52:07,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2018-11-23 00:52:07,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:07,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1109961593, now seen corresponding path program 1 times [2018-11-23 00:52:07,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:07,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:07,289 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 00:52:07,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:07,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:52:07,290 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:52:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:52:07,291 INFO L87 Difference]: Start difference. First operand 520 states and 752 transitions. cyclomatic complexity: 233 Second operand 5 states. [2018-11-23 00:52:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:07,422 INFO L93 Difference]: Finished difference Result 916 states and 1314 transitions. [2018-11-23 00:52:07,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:52:07,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 916 states and 1314 transitions. [2018-11-23 00:52:07,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 890 [2018-11-23 00:52:07,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 916 states to 916 states and 1314 transitions. [2018-11-23 00:52:07,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 916 [2018-11-23 00:52:07,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 916 [2018-11-23 00:52:07,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 916 states and 1314 transitions. [2018-11-23 00:52:07,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:07,436 INFO L705 BuchiCegarLoop]: Abstraction has 916 states and 1314 transitions. [2018-11-23 00:52:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states and 1314 transitions. [2018-11-23 00:52:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 532. [2018-11-23 00:52:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-23 00:52:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 764 transitions. [2018-11-23 00:52:07,450 INFO L728 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2018-11-23 00:52:07,450 INFO L608 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2018-11-23 00:52:07,450 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 00:52:07,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 532 states and 764 transitions. [2018-11-23 00:52:07,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 506 [2018-11-23 00:52:07,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:07,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:07,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,454 INFO L794 eck$LassoCheckResult]: Stem: 3623#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3491#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 3492#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 3505#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3506#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 3589#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3624#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3596#L108 assume !(1 == ~P_1_pc~0); 3532#L108-2 is_P_1_triggered_~__retres1~0 := 0; 3531#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3533#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3534#L481 assume !(0 != activate_threads_~tmp~1); 3653#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3618#L176 assume !(1 == ~P_2_pc~0); 3619#L176-2 is_P_2_triggered_~__retres1~1 := 0; 3620#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3568#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3569#L489 assume !(0 != activate_threads_~tmp___0~1); 3656#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3666#L258 assume !(1 == ~C_1_pc~0); 3661#L258-2 assume !(2 == ~C_1_pc~0); 3575#L268-1 is_C_1_triggered_~__retres1~2 := 0; 3576#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3579#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3528#L497 assume !(0 != activate_threads_~tmp___1~1); 3529#L551-1 [2018-11-23 00:52:07,454 INFO L796 eck$LassoCheckResult]: Loop: 3529#L551-1 assume !false; 3509#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 3476#L387 assume !false; 3477#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3500#L318 assume !(0 == ~P_1_st~0); 3502#L322 assume !(0 == ~P_2_st~0); 3551#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 3552#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3953#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3952#L352 assume !(0 != eval_~tmp___2~0); 3550#L403 start_simulation_~kernel_st~0 := 2; 3493#L288-1 start_simulation_~kernel_st~0 := 3; 3494#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3549#L108-6 assume !(1 == ~P_1_pc~0); 3566#L108-8 is_P_1_triggered_~__retres1~0 := 0; 3595#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3515#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3516#L481-6 assume !(0 != activate_threads_~tmp~1); 3720#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3719#L176-6 assume !(1 == ~P_2_pc~0); 3706#L176-8 is_P_2_triggered_~__retres1~1 := 0; 3707#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4003#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3969#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 3654#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3633#L258-6 assume !(1 == ~C_1_pc~0); 3630#L258-8 assume !(2 == ~C_1_pc~0); 3631#L268-5 is_C_1_triggered_~__retres1~2 := 0; 3965#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3966#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3987#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 3657#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3517#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3518#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3617#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3615#L570 assume !(0 == start_simulation_~tmp~3); 3548#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3525#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3526#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3597#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3598#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3573#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 3486#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 3487#L583 assume !(0 != start_simulation_~tmp___0~2); 3529#L551-1 [2018-11-23 00:52:07,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2018-11-23 00:52:07,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:07,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:07,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1255144909, now seen corresponding path program 1 times [2018-11-23 00:52:07,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:52:07,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:07,510 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 00:52:07,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:07,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:07,511 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:07,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:07,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:07,512 INFO L87 Difference]: Start difference. First operand 532 states and 764 transitions. cyclomatic complexity: 233 Second operand 3 states. [2018-11-23 00:52:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:07,554 INFO L93 Difference]: Finished difference Result 930 states and 1312 transitions. [2018-11-23 00:52:07,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:07,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 930 states and 1312 transitions. [2018-11-23 00:52:07,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 904 [2018-11-23 00:52:07,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 930 states to 930 states and 1312 transitions. [2018-11-23 00:52:07,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 930 [2018-11-23 00:52:07,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 930 [2018-11-23 00:52:07,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 930 states and 1312 transitions. [2018-11-23 00:52:07,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:07,568 INFO L705 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-11-23 00:52:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states and 1312 transitions. [2018-11-23 00:52:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2018-11-23 00:52:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-11-23 00:52:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1312 transitions. [2018-11-23 00:52:07,584 INFO L728 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-11-23 00:52:07,584 INFO L608 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-11-23 00:52:07,584 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 00:52:07,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 930 states and 1312 transitions. [2018-11-23 00:52:07,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 904 [2018-11-23 00:52:07,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:07,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:07,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,589 INFO L794 eck$LassoCheckResult]: Stem: 5092#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 4961#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 4962#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 4974#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 4975#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 5058#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 5093#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5066#L108 assume !(1 == ~P_1_pc~0); 4997#L108-2 is_P_1_triggered_~__retres1~0 := 0; 4996#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4998#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4999#L481 assume !(0 != activate_threads_~tmp~1); 5125#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5088#L176 assume !(1 == ~P_2_pc~0); 5089#L176-2 is_P_2_triggered_~__retres1~1 := 0; 5090#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5035#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5036#L489 assume !(0 != activate_threads_~tmp___0~1); 5130#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5141#L258 assume !(1 == ~C_1_pc~0); 5133#L258-2 assume !(2 == ~C_1_pc~0); 5043#L268-1 is_C_1_triggered_~__retres1~2 := 0; 5044#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5047#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4993#L497 assume !(0 != activate_threads_~tmp___1~1); 4994#L551-1 [2018-11-23 00:52:07,590 INFO L796 eck$LassoCheckResult]: Loop: 4994#L551-1 assume !false; 5342#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 5321#L387 assume !false; 5339#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5337#L318 assume !(0 == ~P_1_st~0); 5338#L322 assume !(0 == ~P_2_st~0); 5539#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 5537#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5535#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 5533#L352 assume !(0 != eval_~tmp___2~0); 5526#L403 start_simulation_~kernel_st~0 := 2; 5524#L288-1 start_simulation_~kernel_st~0 := 3; 5522#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5520#L108-6 assume 1 == ~P_1_pc~0; 5508#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 5506#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5503#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5500#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 5498#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5492#L176-6 assume !(1 == ~P_2_pc~0); 5487#L176-8 is_P_2_triggered_~__retres1~1 := 0; 5466#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5463#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5461#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 5445#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5441#L258-6 assume !(1 == ~C_1_pc~0); 5437#L258-8 assume !(2 == ~C_1_pc~0); 5429#L268-5 is_C_1_triggered_~__retres1~2 := 0; 5421#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5416#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 5411#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5406#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5400#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5399#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5398#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 5383#L570 assume !(0 == start_simulation_~tmp~3); 5379#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5376#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5352#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5351#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 5349#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5348#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 5347#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 5344#L583 assume !(0 != start_simulation_~tmp___0~2); 4994#L551-1 [2018-11-23 00:52:07,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2018-11-23 00:52:07,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:07,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:07,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1406901968, now seen corresponding path program 1 times [2018-11-23 00:52:07,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:52:07,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:07,662 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 00:52:07,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:07,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:52:07,662 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:07,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:52:07,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:52:07,663 INFO L87 Difference]: Start difference. First operand 930 states and 1312 transitions. cyclomatic complexity: 383 Second operand 5 states. [2018-11-23 00:52:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:07,779 INFO L93 Difference]: Finished difference Result 2066 states and 2911 transitions. [2018-11-23 00:52:07,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:52:07,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2066 states and 2911 transitions. [2018-11-23 00:52:07,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2040 [2018-11-23 00:52:07,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2066 states to 2066 states and 2911 transitions. [2018-11-23 00:52:07,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2066 [2018-11-23 00:52:07,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2066 [2018-11-23 00:52:07,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2066 states and 2911 transitions. [2018-11-23 00:52:07,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:07,807 INFO L705 BuchiCegarLoop]: Abstraction has 2066 states and 2911 transitions. [2018-11-23 00:52:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states and 2911 transitions. [2018-11-23 00:52:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 966. [2018-11-23 00:52:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-11-23 00:52:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1339 transitions. [2018-11-23 00:52:07,831 INFO L728 BuchiCegarLoop]: Abstraction has 966 states and 1339 transitions. [2018-11-23 00:52:07,831 INFO L608 BuchiCegarLoop]: Abstraction has 966 states and 1339 transitions. [2018-11-23 00:52:07,831 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 00:52:07,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 966 states and 1339 transitions. [2018-11-23 00:52:07,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 940 [2018-11-23 00:52:07,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:07,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:07,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:07,837 INFO L794 eck$LassoCheckResult]: Stem: 8109#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 7969#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 7970#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 7982#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 7983#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 8068#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 8110#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8077#L108 assume !(1 == ~P_1_pc~0); 8007#L108-2 is_P_1_triggered_~__retres1~0 := 0; 8006#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8008#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8009#L481 assume !(0 != activate_threads_~tmp~1); 8145#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8104#L176 assume !(1 == ~P_2_pc~0); 8105#L176-2 is_P_2_triggered_~__retres1~1 := 0; 8106#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8045#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8046#L489 assume !(0 != activate_threads_~tmp___0~1); 8149#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8158#L258 assume !(1 == ~C_1_pc~0); 8153#L258-2 assume !(2 == ~C_1_pc~0); 8052#L268-1 is_C_1_triggered_~__retres1~2 := 0; 8053#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8057#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8003#L497 assume !(0 != activate_threads_~tmp___1~1); 8004#L551-1 [2018-11-23 00:52:07,837 INFO L796 eck$LassoCheckResult]: Loop: 8004#L551-1 assume !false; 8338#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 8335#L387 assume !false; 8334#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8333#L318 assume !(0 == ~P_1_st~0); 7979#L322 assume !(0 == ~P_2_st~0); 8027#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 8028#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8879#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8878#L352 assume !(0 != eval_~tmp___2~0); 8026#L403 start_simulation_~kernel_st~0 := 2; 7971#L288-1 start_simulation_~kernel_st~0 := 3; 7972#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8025#L108-6 assume 1 == ~P_1_pc~0; 8424#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 8423#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8422#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8421#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 8387#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8384#L176-6 assume !(1 == ~P_2_pc~0); 8382#L176-8 is_P_2_triggered_~__retres1~1 := 0; 8380#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8378#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8376#L489-6 assume !(0 != activate_threads_~tmp___0~1); 8374#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8372#L258-6 assume !(1 == ~C_1_pc~0); 8370#L258-8 assume !(2 == ~C_1_pc~0); 8368#L268-5 is_C_1_triggered_~__retres1~2 := 0; 8366#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8364#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8362#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 8360#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8357#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8355#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8353#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8350#L570 assume !(0 == start_simulation_~tmp~3); 8349#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8347#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8346#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8345#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8344#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8343#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 8342#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 8341#L583 assume !(0 != start_simulation_~tmp___0~2); 8004#L551-1 [2018-11-23 00:52:07,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 4 times [2018-11-23 00:52:07,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:07,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:07,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash -984200142, now seen corresponding path program 1 times [2018-11-23 00:52:07,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:07,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:07,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:52:07,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:07,903 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 00:52:07,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:07,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:52:07,905 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:07,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:52:07,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:52:07,905 INFO L87 Difference]: Start difference. First operand 966 states and 1339 transitions. cyclomatic complexity: 374 Second operand 5 states. [2018-11-23 00:52:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:08,021 INFO L93 Difference]: Finished difference Result 2040 states and 2832 transitions. [2018-11-23 00:52:08,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:52:08,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2040 states and 2832 transitions. [2018-11-23 00:52:08,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2014 [2018-11-23 00:52:08,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2040 states to 2040 states and 2832 transitions. [2018-11-23 00:52:08,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2040 [2018-11-23 00:52:08,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2040 [2018-11-23 00:52:08,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2040 states and 2832 transitions. [2018-11-23 00:52:08,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:08,043 INFO L705 BuchiCegarLoop]: Abstraction has 2040 states and 2832 transitions. [2018-11-23 00:52:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states and 2832 transitions. [2018-11-23 00:52:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 996. [2018-11-23 00:52:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2018-11-23 00:52:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1358 transitions. [2018-11-23 00:52:08,062 INFO L728 BuchiCegarLoop]: Abstraction has 996 states and 1358 transitions. [2018-11-23 00:52:08,062 INFO L608 BuchiCegarLoop]: Abstraction has 996 states and 1358 transitions. [2018-11-23 00:52:08,063 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 00:52:08,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 996 states and 1358 transitions. [2018-11-23 00:52:08,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 970 [2018-11-23 00:52:08,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:08,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:08,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:08,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:08,067 INFO L794 eck$LassoCheckResult]: Stem: 11132#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 10989#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 10990#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 11002#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 11003#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 11093#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 11133#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11103#L108 assume !(1 == ~P_1_pc~0); 11026#L108-2 is_P_1_triggered_~__retres1~0 := 0; 11025#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11027#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11028#L481 assume !(0 != activate_threads_~tmp~1); 11166#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11128#L176 assume !(1 == ~P_2_pc~0); 11129#L176-2 is_P_2_triggered_~__retres1~1 := 0; 11130#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11068#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11069#L489 assume !(0 != activate_threads_~tmp___0~1); 11173#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11184#L258 assume !(1 == ~C_1_pc~0); 11177#L258-2 assume !(2 == ~C_1_pc~0); 11076#L268-1 is_C_1_triggered_~__retres1~2 := 0; 11077#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11080#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11022#L497 assume !(0 != activate_threads_~tmp___1~1); 11023#L551-1 [2018-11-23 00:52:08,067 INFO L796 eck$LassoCheckResult]: Loop: 11023#L551-1 assume !false; 11506#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 11503#L387 assume !false; 11502#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11500#L318 assume !(0 == ~P_1_st~0); 11501#L322 assume !(0 == ~P_2_st~0); 11588#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 11587#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11584#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 11582#L352 assume !(0 != eval_~tmp___2~0); 11579#L403 start_simulation_~kernel_st~0 := 2; 11578#L288-1 start_simulation_~kernel_st~0 := 3; 11045#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11046#L108-6 assume !(1 == ~P_1_pc~0); 11009#L108-8 is_P_1_triggered_~__retres1~0 := 0; 11008#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11011#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11012#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 11577#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11733#L176-6 assume !(1 == ~P_2_pc~0); 11731#L176-8 is_P_2_triggered_~__retres1~1 := 0; 11729#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11727#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11163#L489-6 assume !(0 != activate_threads_~tmp___0~1); 11164#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11143#L258-6 assume !(1 == ~C_1_pc~0); 11144#L258-8 assume !(2 == ~C_1_pc~0); 11536#L268-5 is_C_1_triggered_~__retres1~2 := 0; 11534#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11532#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11530#L497-6 assume !(0 != activate_threads_~tmp___1~1); 11528#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11525#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11523#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11521#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11518#L570 assume !(0 == start_simulation_~tmp~3); 11517#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11515#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11514#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11513#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11512#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11511#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 11510#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 11509#L583 assume !(0 != start_simulation_~tmp___0~2); 11023#L551-1 [2018-11-23 00:52:08,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:08,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 5 times [2018-11-23 00:52:08,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:08,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:08,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash 528178929, now seen corresponding path program 1 times [2018-11-23 00:52:08,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:08,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:08,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:52:08,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:08,135 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 00:52:08,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:08,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:52:08,136 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:52:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:52:08,137 INFO L87 Difference]: Start difference. First operand 996 states and 1358 transitions. cyclomatic complexity: 363 Second operand 5 states. [2018-11-23 00:52:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:08,229 INFO L93 Difference]: Finished difference Result 2384 states and 3231 transitions. [2018-11-23 00:52:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:52:08,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2384 states and 3231 transitions. [2018-11-23 00:52:08,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2329 [2018-11-23 00:52:08,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2384 states to 2384 states and 3231 transitions. [2018-11-23 00:52:08,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2384 [2018-11-23 00:52:08,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2384 [2018-11-23 00:52:08,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2384 states and 3231 transitions. [2018-11-23 00:52:08,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:08,254 INFO L705 BuchiCegarLoop]: Abstraction has 2384 states and 3231 transitions. [2018-11-23 00:52:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states and 3231 transitions. [2018-11-23 00:52:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1059. [2018-11-23 00:52:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-11-23 00:52:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1421 transitions. [2018-11-23 00:52:08,277 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1421 transitions. [2018-11-23 00:52:08,277 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1421 transitions. [2018-11-23 00:52:08,277 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 00:52:08,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1421 transitions. [2018-11-23 00:52:08,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2018-11-23 00:52:08,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:08,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:08,281 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:08,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:08,281 INFO L794 eck$LassoCheckResult]: Stem: 14544#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 14385#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 14386#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 14398#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 14399#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 14498#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 14545#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 14508#L108 assume !(1 == ~P_1_pc~0); 14421#L108-2 is_P_1_triggered_~__retres1~0 := 0; 14506#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 14509#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 14573#L481 assume !(0 != activate_threads_~tmp~1); 14574#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 14539#L176 assume !(1 == ~P_2_pc~0); 14540#L176-2 is_P_2_triggered_~__retres1~1 := 0; 14541#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 14463#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 14464#L489 assume !(0 != activate_threads_~tmp___0~1); 14578#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 14585#L258 assume !(1 == ~C_1_pc~0); 14580#L258-2 assume !(2 == ~C_1_pc~0); 14477#L268-1 is_C_1_triggered_~__retres1~2 := 0; 14478#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 14482#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 14417#L497 assume !(0 != activate_threads_~tmp___1~1); 14418#L551-1 [2018-11-23 00:52:08,281 INFO L796 eck$LassoCheckResult]: Loop: 14418#L551-1 assume !false; 15245#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 15242#L387 assume !false; 15240#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15238#L318 assume !(0 == ~P_1_st~0); 14393#L322 assume !(0 == ~P_2_st~0); 14443#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 14444#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 14992#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 14985#L352 assume !(0 != eval_~tmp___2~0); 14442#L403 start_simulation_~kernel_st~0 := 2; 14383#L288-1 start_simulation_~kernel_st~0 := 3; 14384#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 14441#L108-6 assume 1 == ~P_1_pc~0; 14402#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 14403#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 14747#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 14748#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 15269#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 15348#L176-6 assume !(1 == ~P_2_pc~0); 15347#L176-8 is_P_2_triggered_~__retres1~1 := 0; 15346#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 15345#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15344#L489-6 assume !(0 != activate_threads_~tmp___0~1); 15343#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15342#L258-6 assume !(1 == ~C_1_pc~0); 15341#L258-8 assume !(2 == ~C_1_pc~0); 15340#L268-5 is_C_1_triggered_~__retres1~2 := 0; 15339#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 15338#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 15337#L497-6 assume !(0 != activate_threads_~tmp___1~1); 15336#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15335#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 15334#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15333#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 15332#L570 assume !(0 == start_simulation_~tmp~3); 14440#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15282#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 15281#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15280#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 15279#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 15271#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 14378#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 14379#L583 assume !(0 != start_simulation_~tmp___0~2); 14418#L551-1 [2018-11-23 00:52:08,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:08,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 6 times [2018-11-23 00:52:08,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:08,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:08,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:08,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:08,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1995317392, now seen corresponding path program 1 times [2018-11-23 00:52:08,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:08,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:52:08,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:08,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash -237860646, now seen corresponding path program 1 times [2018-11-23 00:52:08,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:08,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:08,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:08,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:52:08,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:08,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:08,565 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-23 00:52:08,638 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:52:08,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:52:08,639 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:52:08,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:52:08,639 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 00:52:08,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:52:08,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:52:08,639 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:52:08,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-23 00:52:08,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:52:08,640 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:52:08,659 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 00:52:08,679 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 00:52:08,681 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 00:52:08,683 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 00:52:08,687 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 00:52:08,690 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 00:52:08,692 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 00:52:08,699 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 00:52:08,702 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 00:52:08,704 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 00:52:08,706 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 00:52:08,708 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 00:52:08,710 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 00:52:08,721 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 00:52:08,722 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 00:52:08,728 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 00:52:08,740 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 00:52:08,748 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 00:52:08,750 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 00:52:08,754 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 00:52:08,772 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 00:52:08,777 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 00:52:08,779 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 00:52:08,781 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 00:52:08,786 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 00:52:08,790 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 00:52:08,792 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 00:52:08,793 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 00:52:08,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:52:08,947 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:08,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:08,951 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:08,958 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:08,958 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:08,976 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:08,976 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:08,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:08,979 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:08,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:08,997 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,000 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,000 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret10=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:09,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,017 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,020 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,020 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_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:09,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,045 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,052 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,052 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:09,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,080 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,080 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:09,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,104 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,104 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_pc~0=4} Honda state: {~P_2_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:09,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,124 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,128 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:09,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,147 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,147 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/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 00:52:09,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,169 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4=0} Honda state: {ULTIMATE.start_eval_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:52:09,187 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,187 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,189 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,190 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret7=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:52:09,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,232 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet2=0} Honda state: {ULTIMATE.start_eval_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:52:09,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,251 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,251 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_st~0=7} Honda state: {~P_2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:52:09,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,271 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,271 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:52:09,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,292 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:52:09,292 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:52:09,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:52:09,316 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:52:09,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 00:52:09,352 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:52:09,374 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 00:52:09,376 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:52:09,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:52:09,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:52:09,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:52:09,376 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:52:09,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:52:09,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:52:09,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:52:09,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-23 00:52:09,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:52:09,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:52:09,380 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 00:52:09,382 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 00:52:09,388 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 00:52:09,396 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 00:52:09,398 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 00:52:09,399 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 00:52:09,400 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 00:52:09,402 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 00:52:09,404 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 00:52:09,406 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 00:52:09,407 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 00:52:09,408 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 00:52:09,409 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 00:52:09,411 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 00:52:09,413 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 00:52:09,415 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 00:52:09,419 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 00:52:09,423 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 00:52:09,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:52:09,428 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 00:52:09,432 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 00:52:09,436 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 00:52:09,438 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 00:52:09,440 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 00:52:09,443 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 00:52:09,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 00:52:09,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:52:09,459 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 00:52:09,608 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:52:09,612 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:52:09,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,642 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,643 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,659 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,659 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,661 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,672 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,672 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,674 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,675 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:52:09,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:52:09,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,700 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 00:52:09,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,701 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,701 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,703 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,704 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,709 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,709 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,712 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,712 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,714 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,714 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,716 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,717 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,719 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,719 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,721 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,721 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:09,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,724 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,726 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,727 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,729 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,731 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,733 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,734 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,735 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,736 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,737 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,738 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:09,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,740 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,740 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:09,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,745 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,746 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,748 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,749 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,751 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,751 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:09,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,753 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,753 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:09,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,756 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,756 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,759 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,759 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,762 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,762 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,764 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,765 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,767 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,768 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,772 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,776 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,779 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,779 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,780 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 00:52:09,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,783 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,784 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,789 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,790 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,792 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,794 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,795 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,799 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,800 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,801 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,801 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,802 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:09,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,804 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,806 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,807 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,809 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,809 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,813 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,814 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,816 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,816 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,818 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,819 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:09,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,821 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,822 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:09,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,826 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,827 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,829 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,830 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,832 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,832 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,832 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:09,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,834 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,834 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,835 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:09,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,837 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,838 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,841 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,843 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,844 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,849 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,854 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,854 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,857 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,858 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,861 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:09,861 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:09,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,862 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 00:52:09,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,863 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,865 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,866 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,871 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,871 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,874 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,874 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,876 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,876 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,878 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,878 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,880 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,881 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,882 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,882 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,883 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:09,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,885 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,885 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,887 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,888 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,889 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,890 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,896 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,898 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,898 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,900 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,902 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,903 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:09,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,914 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,914 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,915 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:09,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,920 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,920 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,923 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,923 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,930 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,931 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,931 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:09,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,933 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:09,933 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,933 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:09,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,935 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,936 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,949 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,950 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,953 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,954 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,956 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,960 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,961 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,973 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,973 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,977 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,977 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:09,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:52:09,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,980 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:09,981 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:09,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,982 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 00:52:09,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 00:52:09,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:09,989 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:09,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,989 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,990 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:09,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:09,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 00:52:09,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:09,993 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:09,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:09,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:09,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:09,993 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:09,994 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:09,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,016 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,016 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,017 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,018 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,020 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,020 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,021 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,022 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,023 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,023 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,024 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,026 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,027 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,027 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,036 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,036 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,037 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,039 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,039 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,039 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:10,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,044 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,044 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,045 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,056 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,056 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,058 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,058 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,058 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,059 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,060 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,060 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,061 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,061 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,077 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,077 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,078 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,080 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,080 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,080 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,082 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,082 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,083 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:10,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,099 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,100 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,100 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:10,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,115 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,115 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,116 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,118 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,118 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,119 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,123 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,123 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:10,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,128 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,128 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,128 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:10,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,133 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,133 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,134 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,149 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,149 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,150 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,154 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,154 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,155 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,157 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,158 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,174 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,174 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,175 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,181 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,181 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,182 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,186 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,186 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,186 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,187 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,199 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,199 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:52:10,200 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:52:10,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,201 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 00:52:10,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,202 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,202 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,203 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,206 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,206 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,207 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,230 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,230 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,231 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,239 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,239 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,240 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,243 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,244 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,245 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,255 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,256 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,256 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,259 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,259 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,260 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,262 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,263 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,263 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,266 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,281 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,282 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,282 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,285 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,285 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,286 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,288 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,289 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,289 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,309 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,309 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,310 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,312 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,313 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,318 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,319 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,319 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,338 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,338 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,338 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,339 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,339 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,348 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,348 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,349 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,350 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,373 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,373 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,378 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,378 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,379 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,382 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,382 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,389 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,398 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,399 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,399 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,400 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,406 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,407 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,412 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,417 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,417 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,418 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,425 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,425 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,425 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,426 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,436 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,436 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,438 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,445 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,445 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,447 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,455 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,455 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,456 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,457 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,463 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,463 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,463 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,464 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,470 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,470 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:52:10,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,471 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,471 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,474 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 00:52:10,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,475 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,475 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,476 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,478 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,485 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,486 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,488 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,507 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,508 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,510 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,513 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,513 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,514 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,517 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,517 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,518 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,521 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,521 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,521 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,522 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,525 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,525 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,526 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,542 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,542 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,542 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,544 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:10,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,598 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,599 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,600 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,602 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,602 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,604 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,606 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,606 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,607 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,610 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,611 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,616 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,616 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,617 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,618 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,620 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,621 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,621 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,622 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,624 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,624 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,624 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,624 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,626 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:10,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,634 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,634 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,634 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,637 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:10,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,648 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,649 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,651 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,653 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,654 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,656 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,657 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,657 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,658 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:10,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,673 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,673 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,673 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,675 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 00:52:10,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,682 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,683 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,694 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,697 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,697 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,698 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,706 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,706 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,707 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,709 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,710 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,711 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,718 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,719 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,721 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,739 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,739 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,740 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,747 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,753 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,754 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,761 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:10,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,762 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:52:10,763 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:52:10,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,764 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 00:52:10,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 00:52:10,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,765 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,766 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,769 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,770 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,785 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,790 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,791 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,791 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,793 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,794 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,794 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,794 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,819 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,819 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,820 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,822 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,822 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,823 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,823 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,823 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,833 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,834 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,852 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,852 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,852 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,855 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,856 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,856 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,859 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,884 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,888 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,889 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,898 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,899 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,899 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,900 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,916 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,916 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,917 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,917 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,927 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,927 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,928 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,929 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,933 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,934 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,953 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,953 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,953 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,954 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,957 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,957 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,958 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:10,958 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,958 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:52:10,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,963 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,963 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,966 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,986 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,986 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,986 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:10,990 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,991 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,991 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,991 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:10,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:10,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:10,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:10,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:10,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:10,994 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:10,995 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:10,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:10,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:10,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 00:52:11,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,020 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:11,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,020 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:11,021 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:11,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,031 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:11,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,032 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:11,033 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:11,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,037 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:11,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,038 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:11,038 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:11,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,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 00:52:11,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,052 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:52:11,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,053 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:52:11,053 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:52:11,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,055 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 00:52:11,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,056 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,057 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,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 00:52:11,061 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,061 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,062 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,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 00:52:11,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,085 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,085 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,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 00:52:11,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,095 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,095 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,099 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,099 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,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 00:52:11,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,122 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,123 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,132 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,132 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,137 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,137 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:11,137 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,138 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:52:11,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,155 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,156 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,160 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,160 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,161 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,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 00:52:11,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,165 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,165 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,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 00:52:11,191 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,191 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,192 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,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 00:52:11,195 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,195 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,196 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,200 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,201 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,228 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,229 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:11,229 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,229 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:52:11,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,234 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,235 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:11,235 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,236 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:52:11,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,249 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,249 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,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 00:52:11,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,264 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,265 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,269 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,269 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,269 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:11,269 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,270 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:52:11,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,275 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,275 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:52:11,275 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,276 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:52:11,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,302 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,302 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,302 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,310 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,310 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,323 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,323 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,323 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,342 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,342 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,343 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,347 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,347 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,361 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,361 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,361 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,380 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,380 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:52:11,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:52:11,387 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:52:11,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:52:11,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:52:11,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:52:11,393 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:52:11,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:52:11,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:52:11,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:52:11,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:11,397 INFO L87 Difference]: Start difference. First operand 1059 states and 1421 transitions. cyclomatic complexity: 363 Second operand 3 states. [2018-11-23 00:52:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:11,662 INFO L93 Difference]: Finished difference Result 1059 states and 1405 transitions. [2018-11-23 00:52:11,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:11,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1059 states and 1405 transitions. [2018-11-23 00:52:11,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2018-11-23 00:52:11,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1059 states to 1059 states and 1405 transitions. [2018-11-23 00:52:11,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1059 [2018-11-23 00:52:11,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1059 [2018-11-23 00:52:11,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1059 states and 1405 transitions. [2018-11-23 00:52:11,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:11,676 INFO L705 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2018-11-23 00:52:11,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states and 1405 transitions. [2018-11-23 00:52:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2018-11-23 00:52:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-11-23 00:52:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1405 transitions. [2018-11-23 00:52:11,691 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2018-11-23 00:52:11,691 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2018-11-23 00:52:11,691 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 00:52:11,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1405 transitions. [2018-11-23 00:52:11,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2018-11-23 00:52:11,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:11,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:11,696 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:11,696 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:11,696 INFO L794 eck$LassoCheckResult]: Stem: 16652#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 16508#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 16509#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 16521#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 16522#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 16609#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 16653#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 16620#L108 assume !(1 == ~P_1_pc~0); 16546#L108-2 is_P_1_triggered_~__retres1~0 := 0; 16614#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 16696#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 16678#L481 assume !(0 != activate_threads_~tmp~1); 16679#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 16646#L176 assume !(1 == ~P_2_pc~0); 16647#L176-2 is_P_2_triggered_~__retres1~1 := 0; 16648#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 16582#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 16583#L489 assume !(0 != activate_threads_~tmp___0~1); 16684#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 16691#L258 assume !(1 == ~C_1_pc~0); 16687#L258-2 assume !(2 == ~C_1_pc~0); 16592#L268-1 is_C_1_triggered_~__retres1~2 := 0; 16593#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 16597#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 16542#L497 assume !(0 != activate_threads_~tmp___1~1); 16543#L551-1 [2018-11-23 00:52:11,697 INFO L796 eck$LassoCheckResult]: Loop: 16543#L551-1 assume !false; 17152#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 17148#L387 assume !false; 17146#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17144#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17142#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17140#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17138#L352 assume 0 != eval_~tmp___2~0; 17137#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 16615#L361 assume 0 != eval_~tmp~0;~P_1_st~0 := 1; 16616#L73 assume 0 == ~P_1_pc~0; 17403#L77 assume !(~i~0 < ~max_loop~0); 17402#L96 ~P_1_st~0 := 2; 17394#L357 assume !(0 == ~P_2_st~0); 17392#L372 assume !(0 == ~C_1_st~0); 17391#L387 assume !false; 17420#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17418#L318 assume !(0 == ~P_1_st~0); 17416#L322 assume !(0 == ~P_2_st~0); 16565#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 16566#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17412#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17408#L352 assume !(0 != eval_~tmp___2~0); 17409#L403 start_simulation_~kernel_st~0 := 2; 17446#L288-1 start_simulation_~kernel_st~0 := 3; 17444#L414 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17441#L108-6 assume 1 == ~P_1_pc~0; 17438#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 17434#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 17430#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 17426#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 17423#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17323#L176-6 assume !(1 == ~P_2_pc~0); 17322#L176-8 is_P_2_triggered_~__retres1~1 := 0; 17321#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17318#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17315#L489-6 assume !(0 != activate_threads_~tmp___0~1); 17311#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17302#L258-6 assume !(1 == ~C_1_pc~0); 17288#L258-8 assume !(2 == ~C_1_pc~0); 17285#L268-5 is_C_1_triggered_~__retres1~2 := 0; 17283#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17281#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17279#L497-6 assume !(0 != activate_threads_~tmp___1~1); 17275#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17271#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17267#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17261#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 17168#L570 assume !(0 == start_simulation_~tmp~3); 17167#L570-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17166#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17165#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17164#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 17162#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 17160#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 17159#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 17155#L583 assume !(0 != start_simulation_~tmp___0~2); 16543#L551-1 [2018-11-23 00:52:11,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 7 times [2018-11-23 00:52:11,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:11,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:11,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:11,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:11,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1599561696, now seen corresponding path program 1 times [2018-11-23 00:52:11,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:11,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:11,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:11,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:11,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:52:11,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:11,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:11,783 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:52:11,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:11,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:11,783 INFO L87 Difference]: Start difference. First operand 1059 states and 1405 transitions. cyclomatic complexity: 347 Second operand 3 states. [2018-11-23 00:52:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:12,026 INFO L93 Difference]: Finished difference Result 1763 states and 2324 transitions. [2018-11-23 00:52:12,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:12,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1763 states and 2324 transitions. [2018-11-23 00:52:12,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1728 [2018-11-23 00:52:12,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1763 states to 1763 states and 2324 transitions. [2018-11-23 00:52:12,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1763 [2018-11-23 00:52:12,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1763 [2018-11-23 00:52:12,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1763 states and 2324 transitions. [2018-11-23 00:52:12,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:12,049 INFO L705 BuchiCegarLoop]: Abstraction has 1763 states and 2324 transitions. [2018-11-23 00:52:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states and 2324 transitions. [2018-11-23 00:52:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1747. [2018-11-23 00:52:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2018-11-23 00:52:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2304 transitions. [2018-11-23 00:52:12,073 INFO L728 BuchiCegarLoop]: Abstraction has 1747 states and 2304 transitions. [2018-11-23 00:52:12,073 INFO L608 BuchiCegarLoop]: Abstraction has 1747 states and 2304 transitions. [2018-11-23 00:52:12,073 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 00:52:12,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1747 states and 2304 transitions. [2018-11-23 00:52:12,079 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1712 [2018-11-23 00:52:12,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:12,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:12,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:12,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:12,080 INFO L794 eck$LassoCheckResult]: Stem: 19483#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 19335#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 19336#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 19348#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 19349#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 19439#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 19484#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 19452#L108 assume !(1 == ~P_1_pc~0); 19446#L108-2 is_P_1_triggered_~__retres1~0 := 0; 19447#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 19373#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 19374#L481 assume !(0 != activate_threads_~tmp~1); 19515#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 19478#L176 assume !(1 == ~P_2_pc~0); 19479#L176-2 is_P_2_triggered_~__retres1~1 := 0; 19480#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 19411#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 19412#L489 assume !(0 != activate_threads_~tmp___0~1); 19520#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 19531#L258 assume !(1 == ~C_1_pc~0); 19524#L258-2 assume !(2 == ~C_1_pc~0); 19420#L268-1 is_C_1_triggered_~__retres1~2 := 0; 19421#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 19427#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 19371#L497 assume !(0 != activate_threads_~tmp___1~1); 19372#L551-1 assume !false; 21026#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 19444#L387 [2018-11-23 00:52:12,080 INFO L796 eck$LassoCheckResult]: Loop: 19444#L387 assume !false; 21025#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 21024#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 21023#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 21022#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 19496#L352 assume 0 != eval_~tmp___2~0; 19497#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 19448#L361 assume !(0 != eval_~tmp~0); 19450#L357 assume !(0 == ~P_2_st~0); 19325#L372 assume !(0 == ~C_1_st~0); 19444#L387 [2018-11-23 00:52:12,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2018-11-23 00:52:12,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2018-11-23 00:52:12,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2018-11-23 00:52:12,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:12,126 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 00:52:12,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:12,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:12,163 INFO L87 Difference]: Start difference. First operand 1747 states and 2304 transitions. cyclomatic complexity: 560 Second operand 3 states. [2018-11-23 00:52:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:12,198 INFO L93 Difference]: Finished difference Result 2796 states and 3646 transitions. [2018-11-23 00:52:12,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:12,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2796 states and 3646 transitions. [2018-11-23 00:52:12,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2731 [2018-11-23 00:52:12,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2796 states to 2796 states and 3646 transitions. [2018-11-23 00:52:12,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2796 [2018-11-23 00:52:12,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2796 [2018-11-23 00:52:12,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2796 states and 3646 transitions. [2018-11-23 00:52:12,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:12,228 INFO L705 BuchiCegarLoop]: Abstraction has 2796 states and 3646 transitions. [2018-11-23 00:52:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states and 3646 transitions. [2018-11-23 00:52:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2704. [2018-11-23 00:52:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2018-11-23 00:52:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3534 transitions. [2018-11-23 00:52:12,263 INFO L728 BuchiCegarLoop]: Abstraction has 2704 states and 3534 transitions. [2018-11-23 00:52:12,263 INFO L608 BuchiCegarLoop]: Abstraction has 2704 states and 3534 transitions. [2018-11-23 00:52:12,263 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 00:52:12,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2704 states and 3534 transitions. [2018-11-23 00:52:12,271 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2018-11-23 00:52:12,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:12,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:12,272 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:12,272 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:12,272 INFO L794 eck$LassoCheckResult]: Stem: 24042#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 23886#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 23887#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 23899#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 23900#L295-1 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 23990#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 26133#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 26132#L108 assume !(1 == ~P_1_pc~0); 26130#L108-2 is_P_1_triggered_~__retres1~0 := 0; 26128#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 26126#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 26125#L481 assume !(0 != activate_threads_~tmp~1); 26123#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 26121#L176 assume !(1 == ~P_2_pc~0); 26119#L176-2 is_P_2_triggered_~__retres1~1 := 0; 26117#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 26115#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 26113#L489 assume !(0 != activate_threads_~tmp___0~1); 26111#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 26109#L258 assume !(1 == ~C_1_pc~0); 26107#L258-2 assume !(2 == ~C_1_pc~0); 26105#L268-1 is_C_1_triggered_~__retres1~2 := 0; 26103#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 26101#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 26099#L497 assume !(0 != activate_threads_~tmp___1~1); 26097#L551-1 assume !false; 26093#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 26091#L387 [2018-11-23 00:52:12,272 INFO L796 eck$LassoCheckResult]: Loop: 26091#L387 assume !false; 26090#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 26089#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 26087#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 26085#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 26083#L352 assume 0 != eval_~tmp___2~0; 26082#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 26079#L361 assume !(0 != eval_~tmp~0); 26080#L357 assume !(0 == ~P_2_st~0); 23929#L372 assume !(0 == ~C_1_st~0); 26091#L387 [2018-11-23 00:52:12,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash 918352559, now seen corresponding path program 1 times [2018-11-23 00:52:12,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:12,290 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 00:52:12,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:12,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:12,291 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:52:12,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 2 times [2018-11-23 00:52:12,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:12,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:12,342 INFO L87 Difference]: Start difference. First operand 2704 states and 3534 transitions. cyclomatic complexity: 833 Second operand 3 states. [2018-11-23 00:52:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:12,361 INFO L93 Difference]: Finished difference Result 2682 states and 3511 transitions. [2018-11-23 00:52:12,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:12,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2682 states and 3511 transitions. [2018-11-23 00:52:12,433 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2018-11-23 00:52:12,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2682 states to 2682 states and 3511 transitions. [2018-11-23 00:52:12,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2682 [2018-11-23 00:52:12,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2682 [2018-11-23 00:52:12,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2682 states and 3511 transitions. [2018-11-23 00:52:12,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:12,448 INFO L705 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2018-11-23 00:52:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states and 3511 transitions. [2018-11-23 00:52:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2682. [2018-11-23 00:52:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-11-23 00:52:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3511 transitions. [2018-11-23 00:52:12,484 INFO L728 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2018-11-23 00:52:12,484 INFO L608 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2018-11-23 00:52:12,484 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 00:52:12,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2682 states and 3511 transitions. [2018-11-23 00:52:12,491 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2018-11-23 00:52:12,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:12,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:12,492 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:12,492 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:12,492 INFO L794 eck$LassoCheckResult]: Stem: 29437#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 29278#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 29279#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 29293#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 29294#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 29384#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 29438#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 29398#L108 assume !(1 == ~P_1_pc~0); 29395#L108-2 is_P_1_triggered_~__retres1~0 := 0; 29396#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 29316#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 29317#L481 assume !(0 != activate_threads_~tmp~1); 29469#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 29427#L176 assume !(1 == ~P_2_pc~0); 29428#L176-2 is_P_2_triggered_~__retres1~1 := 0; 29429#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 29355#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 29356#L489 assume !(0 != activate_threads_~tmp___0~1); 29475#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 29483#L258 assume !(1 == ~C_1_pc~0); 29478#L258-2 assume !(2 == ~C_1_pc~0); 29366#L268-1 is_C_1_triggered_~__retres1~2 := 0; 29367#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 29371#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 29314#L497 assume !(0 != activate_threads_~tmp___1~1); 29315#L551-1 assume !false; 31076#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 31073#L387 [2018-11-23 00:52:12,492 INFO L796 eck$LassoCheckResult]: Loop: 31073#L387 assume !false; 31071#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 31069#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 31068#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 31067#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 31066#L352 assume 0 != eval_~tmp___2~0; 31065#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 31064#L361 assume !(0 != eval_~tmp~0); 29487#L357 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 29266#L376 assume !(0 != eval_~tmp___0~0); 29268#L372 assume !(0 == ~C_1_st~0); 31073#L387 [2018-11-23 00:52:12,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2018-11-23 00:52:12,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:52:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2018-11-23 00:52:12,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:52:12,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2018-11-23 00:52:12,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:12,542 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 00:52:12,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:12,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:52:12,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:12,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:12,594 INFO L87 Difference]: Start difference. First operand 2682 states and 3511 transitions. cyclomatic complexity: 832 Second operand 3 states. [2018-11-23 00:52:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:12,631 INFO L93 Difference]: Finished difference Result 4410 states and 5717 transitions. [2018-11-23 00:52:12,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:12,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4410 states and 5717 transitions. [2018-11-23 00:52:12,645 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4351 [2018-11-23 00:52:12,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4410 states to 4410 states and 5717 transitions. [2018-11-23 00:52:12,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4410 [2018-11-23 00:52:12,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4410 [2018-11-23 00:52:12,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4410 states and 5717 transitions. [2018-11-23 00:52:12,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:52:12,669 INFO L705 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2018-11-23 00:52:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states and 5717 transitions. [2018-11-23 00:52:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4410. [2018-11-23 00:52:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4410 states. [2018-11-23 00:52:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 5717 transitions. [2018-11-23 00:52:12,728 INFO L728 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2018-11-23 00:52:12,728 INFO L608 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2018-11-23 00:52:12,728 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 00:52:12,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4410 states and 5717 transitions. [2018-11-23 00:52:12,741 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4351 [2018-11-23 00:52:12,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:52:12,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:52:12,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:12,742 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:12,742 INFO L794 eck$LassoCheckResult]: Stem: 36536#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 36380#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 36381#L603 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 36393#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 36394#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 36485#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 36537#L305-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 36497#L108 assume !(1 == ~P_1_pc~0); 36494#L108-2 is_P_1_triggered_~__retres1~0 := 0; 36495#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 36416#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 36417#L481 assume !(0 != activate_threads_~tmp~1); 36574#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 36527#L176 assume !(1 == ~P_2_pc~0); 36528#L176-2 is_P_2_triggered_~__retres1~1 := 0; 36529#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 36455#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 36456#L489 assume !(0 != activate_threads_~tmp___0~1); 36583#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 36590#L258 assume !(1 == ~C_1_pc~0); 36585#L258-2 assume !(2 == ~C_1_pc~0); 36467#L268-1 is_C_1_triggered_~__retres1~2 := 0; 36468#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 36473#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 36414#L497 assume !(0 != activate_threads_~tmp___1~1); 36415#L551-1 assume !false; 37534#L552 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 37533#L387 [2018-11-23 00:52:12,742 INFO L796 eck$LassoCheckResult]: Loop: 37533#L387 assume !false; 37532#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 37530#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 37528#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 37526#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 37524#L352 assume 0 != eval_~tmp___2~0; 37522#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 37519#L361 assume !(0 != eval_~tmp~0); 37520#L357 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 39118#L376 assume !(0 != eval_~tmp___0~0); 37538#L372 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 37535#L391 assume !(0 != eval_~tmp___1~0); 37533#L387 [2018-11-23 00:52:12,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2018-11-23 00:52:12,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:12,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2018-11-23 00:52:12,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:52:12,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2018-11-23 00:52:12,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:12,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:13,075 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; [?] havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~P_1_i~0;~P_1_st~0 := 0; [?] assume 1 == ~P_2_i~0;~P_2_st~0 := 0; [?] assume 1 == ~C_1_i~0;~C_1_st~0 := 0; [?] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; [?] assume !(1 == ~P_1_pc~0); [?] is_P_1_triggered_~__retres1~0 := 0; [?] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [?] activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; [?] assume !(1 == ~P_2_pc~0); [?] is_P_2_triggered_~__retres1~1 := 0; [?] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [?] activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; [?] assume !(0 != activate_threads_~tmp___0~1); [?] havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; [?] assume !(1 == ~C_1_pc~0); [?] assume !(2 == ~C_1_pc~0); [?] is_C_1_triggered_~__retres1~2 := 0; [?] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [?] activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; [?] assume !(0 != activate_threads_~tmp___1~1); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295-L299] assume 1 == ~P_1_i~0; [L296] ~P_1_st~0 := 0; [L300-L304] assume 1 == ~P_2_i~0; [L301] ~P_2_st~0 := 0; [L305-L309] assume 1 == ~C_1_i~0; [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108-L117] assume !(1 == ~P_1_pc~0); [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] assume !(0 != activate_threads_~tmp~1); [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176-L185] assume !(1 == ~P_2_pc~0); [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] assume !(0 != activate_threads_~tmp___0~1); [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258-L267] assume !(1 == ~C_1_pc~0); [L268-L277] assume !(2 == ~C_1_pc~0); [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] assume !(0 != activate_threads_~tmp___1~1); [L551-L588] assume !false; [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295-L299] assume 1 == ~P_1_i~0; [L296] ~P_1_st~0 := 0; [L300-L304] assume 1 == ~P_2_i~0; [L301] ~P_2_st~0 := 0; [L305-L309] assume 1 == ~C_1_i~0; [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108-L117] assume !(1 == ~P_1_pc~0); [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] assume !(0 != activate_threads_~tmp~1); [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176-L185] assume !(1 == ~P_2_pc~0); [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] assume !(0 != activate_threads_~tmp___0~1); [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258-L267] assume !(1 == ~C_1_pc~0); [L268-L277] assume !(2 == ~C_1_pc~0); [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] assume !(0 != activate_threads_~tmp___1~1); [L551-L588] assume !false; [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] COND FALSE !(0 != activate_threads_~tmp~1) [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] COND FALSE !(0 != activate_threads_~tmp___0~1) [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] COND FALSE !(0 != activate_threads_~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] COND FALSE !(0 != activate_threads_~tmp~1) [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] COND FALSE !(0 != activate_threads_~tmp___0~1) [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] COND FALSE !(0 != activate_threads_~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [L607] havoc ~count~0; [L608] havoc ~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] ~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L537] havoc ~kernel_st~0; [L538] havoc ~tmp~3; [L539] havoc ~tmp___0~2; [L543] ~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L473] havoc ~tmp~1; [L474] havoc ~tmp___0~1; [L475] havoc ~tmp___1~1; [L105] havoc ~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] ~__retres1~0 := 0; [L120] #res := ~__retres1~0; [L479] ~tmp~1 := #t~ret5; [L479] havoc #t~ret5; [L481-L485] COND FALSE !(0 != ~tmp~1) [L173] havoc ~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] ~__retres1~1 := 0; [L188] #res := ~__retres1~1; [L487] ~tmp___0~1 := #t~ret6; [L487] havoc #t~ret6; [L489-L493] COND FALSE !(0 != ~tmp___0~1) [L255] havoc ~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] ~__retres1~2 := 0; [L280] #res := ~__retres1~2; [L495] ~tmp___1~1 := #t~ret7; [L495] havoc #t~ret7; [L497-L501] COND FALSE !(0 != ~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] ~kernel_st~0 := 1; [L340] havoc ~tmp~0; [L341] havoc ~tmp___0~0; [L342] havoc ~tmp___1~0; [L343] havoc ~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [L607] havoc ~count~0; [L608] havoc ~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] ~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L537] havoc ~kernel_st~0; [L538] havoc ~tmp~3; [L539] havoc ~tmp___0~2; [L543] ~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L473] havoc ~tmp~1; [L474] havoc ~tmp___0~1; [L475] havoc ~tmp___1~1; [L105] havoc ~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] ~__retres1~0 := 0; [L120] #res := ~__retres1~0; [L479] ~tmp~1 := #t~ret5; [L479] havoc #t~ret5; [L481-L485] COND FALSE !(0 != ~tmp~1) [L173] havoc ~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] ~__retres1~1 := 0; [L188] #res := ~__retres1~1; [L487] ~tmp___0~1 := #t~ret6; [L487] havoc #t~ret6; [L489-L493] COND FALSE !(0 != ~tmp___0~1) [L255] havoc ~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] ~__retres1~2 := 0; [L280] #res := ~__retres1~2; [L495] ~tmp___1~1 := #t~ret7; [L495] havoc #t~ret7; [L497-L501] COND FALSE !(0 != ~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] ~kernel_st~0 := 1; [L340] havoc ~tmp~0; [L341] havoc ~tmp___0~0; [L342] havoc ~tmp___1~0; [L343] havoc ~tmp___2~0; [L15] int max_loop ; [L16] int clk ; [L17] int num ; [L18] int i ; [L19] int e ; [L20] int timer ; [L21] char data_0 ; [L22] char data_1 ; [L65] int P_1_pc; [L66] int P_1_st ; [L67] int P_1_i ; [L68] int P_1_ev ; [L123] int P_2_pc ; [L124] int P_2_st ; [L125] int P_2_i ; [L126] int P_2_ev ; [L191] int C_1_pc ; [L192] int C_1_st ; [L193] int C_1_i ; [L194] int C_1_ev ; [L195] int C_1_pr ; [L607] int count ; [L608] int __retres2 ; [L612] num = 0 [L613] i = 0 [L614] clk = 0 [L615] max_loop = 8 [L617] timer = 0 [L618] P_1_pc = 0 [L619] P_2_pc = 0 [L620] C_1_pc = 0 [L622] count = 0 [L599] P_1_i = 1 [L600] P_2_i = 1 [L601] C_1_i = 1 [L537] int kernel_st ; [L538] int tmp ; [L539] int tmp___0 ; [L543] kernel_st = 0 [L295] COND TRUE (int )P_1_i == 1 [L296] P_1_st = 0 [L300] COND TRUE (int )P_2_i == 1 [L301] P_2_st = 0 [L305] COND TRUE (int )C_1_i == 1 [L306] C_1_st = 0 [L473] int tmp ; [L474] int tmp___0 ; [L475] int tmp___1 ; [L105] int __retres1 ; [L108] COND FALSE !((int )P_1_pc == 1) [L118] __retres1 = 0 [L120] return (__retres1); [L479] tmp = is_P_1_triggered() [L481] COND FALSE !(\read(tmp)) [L173] int __retres1 ; [L176] COND FALSE !((int )P_2_pc == 1) [L186] __retres1 = 0 [L188] return (__retres1); [L487] tmp___0 = is_P_2_triggered() [L489] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; [L258] COND FALSE !((int )C_1_pc == 1) [L268] COND FALSE !((int )C_1_pc == 2) [L278] __retres1 = 0 [L280] return (__retres1); [L495] tmp___1 = is_C_1_triggered() [L497] COND FALSE !(\read(tmp___1)) [L551] COND TRUE 1 [L554] kernel_st = 1 [L340] int tmp ; [L341] int tmp___0 ; [L342] int tmp___1 ; [L343] int tmp___2 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; [?] assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [?] eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; [?] assume 0 != eval_~tmp___2~0; [?] assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume !(0 != eval_~tmp___1~0); [L347-L402] assume !false; [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318-L333] assume 0 == ~P_1_st~0; [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] assume 0 != eval_~tmp___2~0; [L357-L371] assume 0 == ~P_1_st~0; [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] assume !(0 != eval_~tmp~0); [L372-L386] assume 0 == ~P_2_st~0; [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] assume !(0 != eval_~tmp___0~0); [L387-L401] assume 0 == ~C_1_st~0; [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] assume !(0 != eval_~tmp___1~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L347-L402] assume !false; [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318-L333] assume 0 == ~P_1_st~0; [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] assume 0 != eval_~tmp___2~0; [L357-L371] assume 0 == ~P_1_st~0; [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] assume !(0 != eval_~tmp~0); [L372-L386] assume 0 == ~P_2_st~0; [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] assume !(0 != eval_~tmp___0~0); [L387-L401] assume 0 == ~C_1_st~0; [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] assume !(0 != eval_~tmp___1~0); [L347-L402] COND FALSE !(false) [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] COND TRUE 0 != eval_~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] COND FALSE !(0 != eval_~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] COND FALSE !(0 != eval_~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] COND FALSE !(0 != eval_~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L347-L402] COND FALSE !(false) [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] COND TRUE 0 != eval_~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] COND FALSE !(0 != eval_~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] COND FALSE !(0 != eval_~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] COND FALSE !(0 != eval_~tmp___1~0) [L347-L402] COND FALSE !(false) [L315] havoc ~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] ~__retres1~3 := 1; [L336] #res := ~__retres1~3; [L350] ~tmp___2~0 := #t~ret1; [L350] havoc #t~ret1; [L352-L356] COND TRUE 0 != ~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] ~tmp~0 := #t~nondet2; [L359] havoc #t~nondet2; [L361-L368] COND FALSE !(0 != ~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] ~tmp___0~0 := #t~nondet3; [L374] havoc #t~nondet3; [L376-L383] COND FALSE !(0 != ~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] ~tmp___1~0 := #t~nondet4; [L389] havoc #t~nondet4; [L391-L398] COND FALSE !(0 != ~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L347-L402] COND FALSE !(false) [L315] havoc ~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] ~__retres1~3 := 1; [L336] #res := ~__retres1~3; [L350] ~tmp___2~0 := #t~ret1; [L350] havoc #t~ret1; [L352-L356] COND TRUE 0 != ~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] ~tmp~0 := #t~nondet2; [L359] havoc #t~nondet2; [L361-L368] COND FALSE !(0 != ~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] ~tmp___0~0 := #t~nondet3; [L374] havoc #t~nondet3; [L376-L383] COND FALSE !(0 != ~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] ~tmp___1~0 := #t~nondet4; [L389] havoc #t~nondet4; [L391-L398] COND FALSE !(0 != ~tmp___1~0) [L347] COND TRUE 1 [L315] int __retres1 ; [L318] COND TRUE (int )P_1_st == 0 [L319] __retres1 = 1 [L336] return (__retres1); [L350] tmp___2 = exists_runnable_thread() [L352] COND TRUE \read(tmp___2) [L357] COND TRUE (int )P_1_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) [L372] COND TRUE (int )P_2_st == 0 [L374] tmp___0 = __VERIFIER_nondet_int() [L376] COND FALSE !(\read(tmp___0)) [L387] COND TRUE (int )C_1_st == 0 [L389] tmp___1 = __VERIFIER_nondet_int() [L391] COND FALSE !(\read(tmp___1)) ----- [2018-11-23 00:52:13,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:52:13 BoogieIcfgContainer [2018-11-23 00:52:13,158 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 00:52:13,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:52:13,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:52:13,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:52:13,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:06" (3/4) ... [2018-11-23 00:52:13,162 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; [?] havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~P_1_i~0;~P_1_st~0 := 0; [?] assume 1 == ~P_2_i~0;~P_2_st~0 := 0; [?] assume 1 == ~C_1_i~0;~C_1_st~0 := 0; [?] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; [?] assume !(1 == ~P_1_pc~0); [?] is_P_1_triggered_~__retres1~0 := 0; [?] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [?] activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; [?] assume !(1 == ~P_2_pc~0); [?] is_P_2_triggered_~__retres1~1 := 0; [?] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [?] activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; [?] assume !(0 != activate_threads_~tmp___0~1); [?] havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; [?] assume !(1 == ~C_1_pc~0); [?] assume !(2 == ~C_1_pc~0); [?] is_C_1_triggered_~__retres1~2 := 0; [?] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [?] activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; [?] assume !(0 != activate_threads_~tmp___1~1); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295-L299] assume 1 == ~P_1_i~0; [L296] ~P_1_st~0 := 0; [L300-L304] assume 1 == ~P_2_i~0; [L301] ~P_2_st~0 := 0; [L305-L309] assume 1 == ~C_1_i~0; [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108-L117] assume !(1 == ~P_1_pc~0); [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] assume !(0 != activate_threads_~tmp~1); [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176-L185] assume !(1 == ~P_2_pc~0); [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] assume !(0 != activate_threads_~tmp___0~1); [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258-L267] assume !(1 == ~C_1_pc~0); [L268-L277] assume !(2 == ~C_1_pc~0); [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] assume !(0 != activate_threads_~tmp___1~1); [L551-L588] assume !false; [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295-L299] assume 1 == ~P_1_i~0; [L296] ~P_1_st~0 := 0; [L300-L304] assume 1 == ~P_2_i~0; [L301] ~P_2_st~0 := 0; [L305-L309] assume 1 == ~C_1_i~0; [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108-L117] assume !(1 == ~P_1_pc~0); [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] assume !(0 != activate_threads_~tmp~1); [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176-L185] assume !(1 == ~P_2_pc~0); [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] assume !(0 != activate_threads_~tmp___0~1); [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258-L267] assume !(1 == ~C_1_pc~0); [L268-L277] assume !(2 == ~C_1_pc~0); [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] assume !(0 != activate_threads_~tmp___1~1); [L551-L588] assume !false; [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] COND FALSE !(0 != activate_threads_~tmp~1) [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] COND FALSE !(0 != activate_threads_~tmp___0~1) [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] COND FALSE !(0 != activate_threads_~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] COND FALSE !(0 != activate_threads_~tmp~1) [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] COND FALSE !(0 != activate_threads_~tmp___0~1) [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] COND FALSE !(0 != activate_threads_~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [L607] havoc ~count~0; [L608] havoc ~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] ~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L537] havoc ~kernel_st~0; [L538] havoc ~tmp~3; [L539] havoc ~tmp___0~2; [L543] ~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L473] havoc ~tmp~1; [L474] havoc ~tmp___0~1; [L475] havoc ~tmp___1~1; [L105] havoc ~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] ~__retres1~0 := 0; [L120] #res := ~__retres1~0; [L479] ~tmp~1 := #t~ret5; [L479] havoc #t~ret5; [L481-L485] COND FALSE !(0 != ~tmp~1) [L173] havoc ~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] ~__retres1~1 := 0; [L188] #res := ~__retres1~1; [L487] ~tmp___0~1 := #t~ret6; [L487] havoc #t~ret6; [L489-L493] COND FALSE !(0 != ~tmp___0~1) [L255] havoc ~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] ~__retres1~2 := 0; [L280] #res := ~__retres1~2; [L495] ~tmp___1~1 := #t~ret7; [L495] havoc #t~ret7; [L497-L501] COND FALSE !(0 != ~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] ~kernel_st~0 := 1; [L340] havoc ~tmp~0; [L341] havoc ~tmp___0~0; [L342] havoc ~tmp___1~0; [L343] havoc ~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [L607] havoc ~count~0; [L608] havoc ~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] ~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L537] havoc ~kernel_st~0; [L538] havoc ~tmp~3; [L539] havoc ~tmp___0~2; [L543] ~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L473] havoc ~tmp~1; [L474] havoc ~tmp___0~1; [L475] havoc ~tmp___1~1; [L105] havoc ~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] ~__retres1~0 := 0; [L120] #res := ~__retres1~0; [L479] ~tmp~1 := #t~ret5; [L479] havoc #t~ret5; [L481-L485] COND FALSE !(0 != ~tmp~1) [L173] havoc ~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] ~__retres1~1 := 0; [L188] #res := ~__retres1~1; [L487] ~tmp___0~1 := #t~ret6; [L487] havoc #t~ret6; [L489-L493] COND FALSE !(0 != ~tmp___0~1) [L255] havoc ~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] ~__retres1~2 := 0; [L280] #res := ~__retres1~2; [L495] ~tmp___1~1 := #t~ret7; [L495] havoc #t~ret7; [L497-L501] COND FALSE !(0 != ~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] ~kernel_st~0 := 1; [L340] havoc ~tmp~0; [L341] havoc ~tmp___0~0; [L342] havoc ~tmp___1~0; [L343] havoc ~tmp___2~0; [L15] int max_loop ; [L16] int clk ; [L17] int num ; [L18] int i ; [L19] int e ; [L20] int timer ; [L21] char data_0 ; [L22] char data_1 ; [L65] int P_1_pc; [L66] int P_1_st ; [L67] int P_1_i ; [L68] int P_1_ev ; [L123] int P_2_pc ; [L124] int P_2_st ; [L125] int P_2_i ; [L126] int P_2_ev ; [L191] int C_1_pc ; [L192] int C_1_st ; [L193] int C_1_i ; [L194] int C_1_ev ; [L195] int C_1_pr ; [L607] int count ; [L608] int __retres2 ; [L612] num = 0 [L613] i = 0 [L614] clk = 0 [L615] max_loop = 8 [L617] timer = 0 [L618] P_1_pc = 0 [L619] P_2_pc = 0 [L620] C_1_pc = 0 [L622] count = 0 [L599] P_1_i = 1 [L600] P_2_i = 1 [L601] C_1_i = 1 [L537] int kernel_st ; [L538] int tmp ; [L539] int tmp___0 ; [L543] kernel_st = 0 [L295] COND TRUE (int )P_1_i == 1 [L296] P_1_st = 0 [L300] COND TRUE (int )P_2_i == 1 [L301] P_2_st = 0 [L305] COND TRUE (int )C_1_i == 1 [L306] C_1_st = 0 [L473] int tmp ; [L474] int tmp___0 ; [L475] int tmp___1 ; [L105] int __retres1 ; [L108] COND FALSE !((int )P_1_pc == 1) [L118] __retres1 = 0 [L120] return (__retres1); [L479] tmp = is_P_1_triggered() [L481] COND FALSE !(\read(tmp)) [L173] int __retres1 ; [L176] COND FALSE !((int )P_2_pc == 1) [L186] __retres1 = 0 [L188] return (__retres1); [L487] tmp___0 = is_P_2_triggered() [L489] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; [L258] COND FALSE !((int )C_1_pc == 1) [L268] COND FALSE !((int )C_1_pc == 2) [L278] __retres1 = 0 [L280] return (__retres1); [L495] tmp___1 = is_C_1_triggered() [L497] COND FALSE !(\read(tmp___1)) [L551] COND TRUE 1 [L554] kernel_st = 1 [L340] int tmp ; [L341] int tmp___0 ; [L342] int tmp___1 ; [L343] int tmp___2 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; [?] assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [?] eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; [?] assume 0 != eval_~tmp___2~0; [?] assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume !(0 != eval_~tmp___1~0); [L347-L402] assume !false; [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318-L333] assume 0 == ~P_1_st~0; [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] assume 0 != eval_~tmp___2~0; [L357-L371] assume 0 == ~P_1_st~0; [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] assume !(0 != eval_~tmp~0); [L372-L386] assume 0 == ~P_2_st~0; [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] assume !(0 != eval_~tmp___0~0); [L387-L401] assume 0 == ~C_1_st~0; [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] assume !(0 != eval_~tmp___1~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L347-L402] assume !false; [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318-L333] assume 0 == ~P_1_st~0; [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] assume 0 != eval_~tmp___2~0; [L357-L371] assume 0 == ~P_1_st~0; [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] assume !(0 != eval_~tmp~0); [L372-L386] assume 0 == ~P_2_st~0; [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] assume !(0 != eval_~tmp___0~0); [L387-L401] assume 0 == ~C_1_st~0; [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] assume !(0 != eval_~tmp___1~0); [L347-L402] COND FALSE !(false) [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] COND TRUE 0 != eval_~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] COND FALSE !(0 != eval_~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] COND FALSE !(0 != eval_~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] COND FALSE !(0 != eval_~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L347-L402] COND FALSE !(false) [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] COND TRUE 0 != eval_~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] COND FALSE !(0 != eval_~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] COND FALSE !(0 != eval_~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] COND FALSE !(0 != eval_~tmp___1~0) [L347-L402] COND FALSE !(false) [L315] havoc ~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] ~__retres1~3 := 1; [L336] #res := ~__retres1~3; [L350] ~tmp___2~0 := #t~ret1; [L350] havoc #t~ret1; [L352-L356] COND TRUE 0 != ~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] ~tmp~0 := #t~nondet2; [L359] havoc #t~nondet2; [L361-L368] COND FALSE !(0 != ~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] ~tmp___0~0 := #t~nondet3; [L374] havoc #t~nondet3; [L376-L383] COND FALSE !(0 != ~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] ~tmp___1~0 := #t~nondet4; [L389] havoc #t~nondet4; [L391-L398] COND FALSE !(0 != ~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L347-L402] COND FALSE !(false) [L315] havoc ~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] ~__retres1~3 := 1; [L336] #res := ~__retres1~3; [L350] ~tmp___2~0 := #t~ret1; [L350] havoc #t~ret1; [L352-L356] COND TRUE 0 != ~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] ~tmp~0 := #t~nondet2; [L359] havoc #t~nondet2; [L361-L368] COND FALSE !(0 != ~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] ~tmp___0~0 := #t~nondet3; [L374] havoc #t~nondet3; [L376-L383] COND FALSE !(0 != ~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] ~tmp___1~0 := #t~nondet4; [L389] havoc #t~nondet4; [L391-L398] COND FALSE !(0 != ~tmp___1~0) [L347] COND TRUE 1 [L315] int __retres1 ; [L318] COND TRUE (int )P_1_st == 0 [L319] __retres1 = 1 [L336] return (__retres1); [L350] tmp___2 = exists_runnable_thread() [L352] COND TRUE \read(tmp___2) [L357] COND TRUE (int )P_1_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) [L372] COND TRUE (int )P_2_st == 0 [L374] tmp___0 = __VERIFIER_nondet_int() [L376] COND FALSE !(\read(tmp___0)) [L387] COND TRUE (int )C_1_st == 0 [L389] tmp___1 = __VERIFIER_nondet_int() [L391] COND FALSE !(\read(tmp___1)) ----- [2018-11-23 00:52:13,633 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fe9116eb-5205-4568-ace9-bf48fdaf5cd6/bin-2019/uautomizer/witness.graphml [2018-11-23 00:52:13,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:52:13,634 INFO L168 Benchmark]: Toolchain (without parser) took 7942.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -100.2 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:13,658 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:52:13,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.69 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 942.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:13,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:13,659 INFO L168 Benchmark]: Boogie Preprocessor took 26.04 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 00:52:13,659 INFO L168 Benchmark]: RCFGBuilder took 481.11 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:13,659 INFO L168 Benchmark]: BuchiAutomizer took 6630.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.4 MB). Peak memory consumption was 175.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:13,659 INFO L168 Benchmark]: Witness Printer took 474.89 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:13,662 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.69 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 942.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.04 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 481.11 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6630.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.4 MB). Peak memory consumption was 175.8 MB. Max. memory is 11.5 GB. * Witness Printer took 474.89 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 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 14 terminating modules (14 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.14 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 4410 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.9s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 3992 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 4410 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3601 SDtfs, 4398 SDslu, 4843 SDs, 0 SdLazy, 314 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc3 concLT0 SILN1 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 347]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {count=0, \result=0, P_1_pc=0, C_1_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e2dd4f1=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31c9b507=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@115d55e1=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2dd9468d=0, tmp___2=1, tmp___0=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=0, clk=0, __retres1=0, tmp___0=0, num=0, P_1_ev=0, tmp=0, C_1_pc=0, P_2_st=0, P_2_i=1, \result=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bef252e=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=8, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1280a182=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60021117=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3101696f=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@162c366a=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 347]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; [?] havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~P_1_i~0;~P_1_st~0 := 0; [?] assume 1 == ~P_2_i~0;~P_2_st~0 := 0; [?] assume 1 == ~C_1_i~0;~C_1_st~0 := 0; [?] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; [?] assume !(1 == ~P_1_pc~0); [?] is_P_1_triggered_~__retres1~0 := 0; [?] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [?] activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; [?] assume !(1 == ~P_2_pc~0); [?] is_P_2_triggered_~__retres1~1 := 0; [?] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [?] activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; [?] assume !(0 != activate_threads_~tmp___0~1); [?] havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; [?] assume !(1 == ~C_1_pc~0); [?] assume !(2 == ~C_1_pc~0); [?] is_C_1_triggered_~__retres1~2 := 0; [?] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [?] activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; [?] assume !(0 != activate_threads_~tmp___1~1); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295-L299] assume 1 == ~P_1_i~0; [L296] ~P_1_st~0 := 0; [L300-L304] assume 1 == ~P_2_i~0; [L301] ~P_2_st~0 := 0; [L305-L309] assume 1 == ~C_1_i~0; [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108-L117] assume !(1 == ~P_1_pc~0); [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] assume !(0 != activate_threads_~tmp~1); [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176-L185] assume !(1 == ~P_2_pc~0); [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] assume !(0 != activate_threads_~tmp___0~1); [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258-L267] assume !(1 == ~C_1_pc~0); [L268-L277] assume !(2 == ~C_1_pc~0); [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] assume !(0 != activate_threads_~tmp___1~1); [L551-L588] assume !false; [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295-L299] assume 1 == ~P_1_i~0; [L296] ~P_1_st~0 := 0; [L300-L304] assume 1 == ~P_2_i~0; [L301] ~P_2_st~0 := 0; [L305-L309] assume 1 == ~C_1_i~0; [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108-L117] assume !(1 == ~P_1_pc~0); [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] assume !(0 != activate_threads_~tmp~1); [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176-L185] assume !(1 == ~P_2_pc~0); [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] assume !(0 != activate_threads_~tmp___0~1); [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258-L267] assume !(1 == ~C_1_pc~0); [L268-L277] assume !(2 == ~C_1_pc~0); [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] assume !(0 != activate_threads_~tmp___1~1); [L551-L588] assume !false; [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] COND FALSE !(0 != activate_threads_~tmp~1) [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] COND FALSE !(0 != activate_threads_~tmp___0~1) [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] COND FALSE !(0 != activate_threads_~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] COND FALSE !(0 != activate_threads_~tmp~1) [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] COND FALSE !(0 != activate_threads_~tmp___0~1) [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] COND FALSE !(0 != activate_threads_~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [L607] havoc ~count~0; [L608] havoc ~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] ~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L537] havoc ~kernel_st~0; [L538] havoc ~tmp~3; [L539] havoc ~tmp___0~2; [L543] ~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L473] havoc ~tmp~1; [L474] havoc ~tmp___0~1; [L475] havoc ~tmp___1~1; [L105] havoc ~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] ~__retres1~0 := 0; [L120] #res := ~__retres1~0; [L479] ~tmp~1 := #t~ret5; [L479] havoc #t~ret5; [L481-L485] COND FALSE !(0 != ~tmp~1) [L173] havoc ~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] ~__retres1~1 := 0; [L188] #res := ~__retres1~1; [L487] ~tmp___0~1 := #t~ret6; [L487] havoc #t~ret6; [L489-L493] COND FALSE !(0 != ~tmp___0~1) [L255] havoc ~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] ~__retres1~2 := 0; [L280] #res := ~__retres1~2; [L495] ~tmp___1~1 := #t~ret7; [L495] havoc #t~ret7; [L497-L501] COND FALSE !(0 != ~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] ~kernel_st~0 := 1; [L340] havoc ~tmp~0; [L341] havoc ~tmp___0~0; [L342] havoc ~tmp___1~0; [L343] havoc ~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [L607] havoc ~count~0; [L608] havoc ~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] ~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L537] havoc ~kernel_st~0; [L538] havoc ~tmp~3; [L539] havoc ~tmp___0~2; [L543] ~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L473] havoc ~tmp~1; [L474] havoc ~tmp___0~1; [L475] havoc ~tmp___1~1; [L105] havoc ~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] ~__retres1~0 := 0; [L120] #res := ~__retres1~0; [L479] ~tmp~1 := #t~ret5; [L479] havoc #t~ret5; [L481-L485] COND FALSE !(0 != ~tmp~1) [L173] havoc ~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] ~__retres1~1 := 0; [L188] #res := ~__retres1~1; [L487] ~tmp___0~1 := #t~ret6; [L487] havoc #t~ret6; [L489-L493] COND FALSE !(0 != ~tmp___0~1) [L255] havoc ~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] ~__retres1~2 := 0; [L280] #res := ~__retres1~2; [L495] ~tmp___1~1 := #t~ret7; [L495] havoc #t~ret7; [L497-L501] COND FALSE !(0 != ~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] ~kernel_st~0 := 1; [L340] havoc ~tmp~0; [L341] havoc ~tmp___0~0; [L342] havoc ~tmp___1~0; [L343] havoc ~tmp___2~0; [L15] int max_loop ; [L16] int clk ; [L17] int num ; [L18] int i ; [L19] int e ; [L20] int timer ; [L21] char data_0 ; [L22] char data_1 ; [L65] int P_1_pc; [L66] int P_1_st ; [L67] int P_1_i ; [L68] int P_1_ev ; [L123] int P_2_pc ; [L124] int P_2_st ; [L125] int P_2_i ; [L126] int P_2_ev ; [L191] int C_1_pc ; [L192] int C_1_st ; [L193] int C_1_i ; [L194] int C_1_ev ; [L195] int C_1_pr ; [L607] int count ; [L608] int __retres2 ; [L612] num = 0 [L613] i = 0 [L614] clk = 0 [L615] max_loop = 8 [L617] timer = 0 [L618] P_1_pc = 0 [L619] P_2_pc = 0 [L620] C_1_pc = 0 [L622] count = 0 [L599] P_1_i = 1 [L600] P_2_i = 1 [L601] C_1_i = 1 [L537] int kernel_st ; [L538] int tmp ; [L539] int tmp___0 ; [L543] kernel_st = 0 [L295] COND TRUE (int )P_1_i == 1 [L296] P_1_st = 0 [L300] COND TRUE (int )P_2_i == 1 [L301] P_2_st = 0 [L305] COND TRUE (int )C_1_i == 1 [L306] C_1_st = 0 [L473] int tmp ; [L474] int tmp___0 ; [L475] int tmp___1 ; [L105] int __retres1 ; [L108] COND FALSE !((int )P_1_pc == 1) [L118] __retres1 = 0 [L120] return (__retres1); [L479] tmp = is_P_1_triggered() [L481] COND FALSE !(\read(tmp)) [L173] int __retres1 ; [L176] COND FALSE !((int )P_2_pc == 1) [L186] __retres1 = 0 [L188] return (__retres1); [L487] tmp___0 = is_P_2_triggered() [L489] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; [L258] COND FALSE !((int )C_1_pc == 1) [L268] COND FALSE !((int )C_1_pc == 2) [L278] __retres1 = 0 [L280] return (__retres1); [L495] tmp___1 = is_C_1_triggered() [L497] COND FALSE !(\read(tmp___1)) [L551] COND TRUE 1 [L554] kernel_st = 1 [L340] int tmp ; [L341] int tmp___0 ; [L342] int tmp___1 ; [L343] int tmp___2 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; [?] assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [?] eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; [?] assume 0 != eval_~tmp___2~0; [?] assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume !(0 != eval_~tmp___1~0); [L347-L402] assume !false; [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318-L333] assume 0 == ~P_1_st~0; [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] assume 0 != eval_~tmp___2~0; [L357-L371] assume 0 == ~P_1_st~0; [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] assume !(0 != eval_~tmp~0); [L372-L386] assume 0 == ~P_2_st~0; [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] assume !(0 != eval_~tmp___0~0); [L387-L401] assume 0 == ~C_1_st~0; [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] assume !(0 != eval_~tmp___1~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L347-L402] assume !false; [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318-L333] assume 0 == ~P_1_st~0; [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] assume 0 != eval_~tmp___2~0; [L357-L371] assume 0 == ~P_1_st~0; [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] assume !(0 != eval_~tmp~0); [L372-L386] assume 0 == ~P_2_st~0; [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] assume !(0 != eval_~tmp___0~0); [L387-L401] assume 0 == ~C_1_st~0; [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] assume !(0 != eval_~tmp___1~0); [L347-L402] COND FALSE !(false) [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] COND TRUE 0 != eval_~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] COND FALSE !(0 != eval_~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] COND FALSE !(0 != eval_~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] COND FALSE !(0 != eval_~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L347-L402] COND FALSE !(false) [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] COND TRUE 0 != eval_~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] COND FALSE !(0 != eval_~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] COND FALSE !(0 != eval_~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] COND FALSE !(0 != eval_~tmp___1~0) [L347-L402] COND FALSE !(false) [L315] havoc ~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] ~__retres1~3 := 1; [L336] #res := ~__retres1~3; [L350] ~tmp___2~0 := #t~ret1; [L350] havoc #t~ret1; [L352-L356] COND TRUE 0 != ~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] ~tmp~0 := #t~nondet2; [L359] havoc #t~nondet2; [L361-L368] COND FALSE !(0 != ~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] ~tmp___0~0 := #t~nondet3; [L374] havoc #t~nondet3; [L376-L383] COND FALSE !(0 != ~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] ~tmp___1~0 := #t~nondet4; [L389] havoc #t~nondet4; [L391-L398] COND FALSE !(0 != ~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L347-L402] COND FALSE !(false) [L315] havoc ~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] ~__retres1~3 := 1; [L336] #res := ~__retres1~3; [L350] ~tmp___2~0 := #t~ret1; [L350] havoc #t~ret1; [L352-L356] COND TRUE 0 != ~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] ~tmp~0 := #t~nondet2; [L359] havoc #t~nondet2; [L361-L368] COND FALSE !(0 != ~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] ~tmp___0~0 := #t~nondet3; [L374] havoc #t~nondet3; [L376-L383] COND FALSE !(0 != ~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] ~tmp___1~0 := #t~nondet4; [L389] havoc #t~nondet4; [L391-L398] COND FALSE !(0 != ~tmp___1~0) [L347] COND TRUE 1 [L315] int __retres1 ; [L318] COND TRUE (int )P_1_st == 0 [L319] __retres1 = 1 [L336] return (__retres1); [L350] tmp___2 = exists_runnable_thread() [L352] COND TRUE \read(tmp___2) [L357] COND TRUE (int )P_1_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) [L372] COND TRUE (int )P_2_st == 0 [L374] tmp___0 = __VERIFIER_nondet_int() [L376] COND FALSE !(\read(tmp___0)) [L387] COND TRUE (int )C_1_st == 0 [L389] tmp___1 = __VERIFIER_nondet_int() [L391] COND FALSE !(\read(tmp___1)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; [?] havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~P_1_i~0;~P_1_st~0 := 0; [?] assume 1 == ~P_2_i~0;~P_2_st~0 := 0; [?] assume 1 == ~C_1_i~0;~C_1_st~0 := 0; [?] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; [?] assume !(1 == ~P_1_pc~0); [?] is_P_1_triggered_~__retres1~0 := 0; [?] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [?] activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; [?] assume !(1 == ~P_2_pc~0); [?] is_P_2_triggered_~__retres1~1 := 0; [?] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [?] activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; [?] assume !(0 != activate_threads_~tmp___0~1); [?] havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; [?] assume !(1 == ~C_1_pc~0); [?] assume !(2 == ~C_1_pc~0); [?] is_C_1_triggered_~__retres1~2 := 0; [?] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [?] activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; [?] assume !(0 != activate_threads_~tmp___1~1); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295-L299] assume 1 == ~P_1_i~0; [L296] ~P_1_st~0 := 0; [L300-L304] assume 1 == ~P_2_i~0; [L301] ~P_2_st~0 := 0; [L305-L309] assume 1 == ~C_1_i~0; [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108-L117] assume !(1 == ~P_1_pc~0); [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] assume !(0 != activate_threads_~tmp~1); [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176-L185] assume !(1 == ~P_2_pc~0); [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] assume !(0 != activate_threads_~tmp___0~1); [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258-L267] assume !(1 == ~C_1_pc~0); [L268-L277] assume !(2 == ~C_1_pc~0); [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] assume !(0 != activate_threads_~tmp___1~1); [L551-L588] assume !false; [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295-L299] assume 1 == ~P_1_i~0; [L296] ~P_1_st~0 := 0; [L300-L304] assume 1 == ~P_2_i~0; [L301] ~P_2_st~0 := 0; [L305-L309] assume 1 == ~C_1_i~0; [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108-L117] assume !(1 == ~P_1_pc~0); [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] assume !(0 != activate_threads_~tmp~1); [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176-L185] assume !(1 == ~P_2_pc~0); [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] assume !(0 != activate_threads_~tmp___0~1); [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258-L267] assume !(1 == ~C_1_pc~0); [L268-L277] assume !(2 == ~C_1_pc~0); [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] assume !(0 != activate_threads_~tmp___1~1); [L551-L588] assume !false; [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] COND FALSE !(0 != activate_threads_~tmp~1) [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] COND FALSE !(0 != activate_threads_~tmp___0~1) [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] COND FALSE !(0 != activate_threads_~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L607] havoc main_~count~0; [L608] havoc main_~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] main_~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L624] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L537] havoc start_simulation_~kernel_st~0; [L538] havoc start_simulation_~tmp~3; [L539] havoc start_simulation_~tmp___0~2; [L543] start_simulation_~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L547] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L473] havoc activate_threads_~tmp~1; [L474] havoc activate_threads_~tmp___0~1; [L475] havoc activate_threads_~tmp___1~1; [L479] havoc is_P_1_triggered_#res; [L479] havoc is_P_1_triggered_~__retres1~0; [L105] havoc is_P_1_triggered_~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] is_P_1_triggered_~__retres1~0 := 0; [L120] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L479] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L479] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L479] havoc activate_threads_#t~ret5; [L481-L485] COND FALSE !(0 != activate_threads_~tmp~1) [L487] havoc is_P_2_triggered_#res; [L487] havoc is_P_2_triggered_~__retres1~1; [L173] havoc is_P_2_triggered_~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] is_P_2_triggered_~__retres1~1 := 0; [L188] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L487] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L487] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L487] havoc activate_threads_#t~ret6; [L489-L493] COND FALSE !(0 != activate_threads_~tmp___0~1) [L495] havoc is_C_1_triggered_#res; [L495] havoc is_C_1_triggered_~__retres1~2; [L255] havoc is_C_1_triggered_~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] is_C_1_triggered_~__retres1~2 := 0; [L280] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L495] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L495] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L495] havoc activate_threads_#t~ret7; [L497-L501] COND FALSE !(0 != activate_threads_~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] start_simulation_~kernel_st~0 := 1; [L555] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L340] havoc eval_~tmp~0; [L341] havoc eval_~tmp___0~0; [L342] havoc eval_~tmp___1~0; [L343] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [L607] havoc ~count~0; [L608] havoc ~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] ~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L537] havoc ~kernel_st~0; [L538] havoc ~tmp~3; [L539] havoc ~tmp___0~2; [L543] ~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L473] havoc ~tmp~1; [L474] havoc ~tmp___0~1; [L475] havoc ~tmp___1~1; [L105] havoc ~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] ~__retres1~0 := 0; [L120] #res := ~__retres1~0; [L479] ~tmp~1 := #t~ret5; [L479] havoc #t~ret5; [L481-L485] COND FALSE !(0 != ~tmp~1) [L173] havoc ~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] ~__retres1~1 := 0; [L188] #res := ~__retres1~1; [L487] ~tmp___0~1 := #t~ret6; [L487] havoc #t~ret6; [L489-L493] COND FALSE !(0 != ~tmp___0~1) [L255] havoc ~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] ~__retres1~2 := 0; [L280] #res := ~__retres1~2; [L495] ~tmp___1~1 := #t~ret7; [L495] havoc #t~ret7; [L497-L501] COND FALSE !(0 != ~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] ~kernel_st~0 := 1; [L340] havoc ~tmp~0; [L341] havoc ~tmp___0~0; [L342] havoc ~tmp___1~0; [L343] havoc ~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~max_loop~0 := 0; [L16] ~clk~0 := 0; [L17] ~num~0 := 0; [L18] ~i~0 := 0; [L19] ~e~0 := 0; [L20] ~timer~0 := 0; [L21] ~data_0~0 := 0; [L22] ~data_1~0 := 0; [L65] ~P_1_pc~0 := 0; [L66] ~P_1_st~0 := 0; [L67] ~P_1_i~0 := 0; [L68] ~P_1_ev~0 := 0; [L123] ~P_2_pc~0 := 0; [L124] ~P_2_st~0 := 0; [L125] ~P_2_i~0 := 0; [L126] ~P_2_ev~0 := 0; [L191] ~C_1_pc~0 := 0; [L192] ~C_1_st~0 := 0; [L193] ~C_1_i~0 := 0; [L194] ~C_1_ev~0 := 0; [L195] ~C_1_pr~0 := 0; [L607] havoc ~count~0; [L608] havoc ~__retres2~1; [L612] ~num~0 := 0; [L613] ~i~0 := 0; [L614] ~clk~0 := 0; [L615] ~max_loop~0 := 8; [L617] ~timer~0 := 0; [L618] ~P_1_pc~0 := 0; [L619] ~P_2_pc~0 := 0; [L620] ~C_1_pc~0 := 0; [L622] ~count~0 := 0; [L599] ~P_1_i~0 := 1; [L600] ~P_2_i~0 := 1; [L601] ~C_1_i~0 := 1; [L537] havoc ~kernel_st~0; [L538] havoc ~tmp~3; [L539] havoc ~tmp___0~2; [L543] ~kernel_st~0 := 0; [L295] COND TRUE 1 == ~P_1_i~0 [L296] ~P_1_st~0 := 0; [L300] COND TRUE 1 == ~P_2_i~0 [L301] ~P_2_st~0 := 0; [L305] COND TRUE 1 == ~C_1_i~0 [L306] ~C_1_st~0 := 0; [L473] havoc ~tmp~1; [L474] havoc ~tmp___0~1; [L475] havoc ~tmp___1~1; [L105] havoc ~__retres1~0; [L108] COND FALSE !(1 == ~P_1_pc~0) [L118] ~__retres1~0 := 0; [L120] #res := ~__retres1~0; [L479] ~tmp~1 := #t~ret5; [L479] havoc #t~ret5; [L481-L485] COND FALSE !(0 != ~tmp~1) [L173] havoc ~__retres1~1; [L176] COND FALSE !(1 == ~P_2_pc~0) [L186] ~__retres1~1 := 0; [L188] #res := ~__retres1~1; [L487] ~tmp___0~1 := #t~ret6; [L487] havoc #t~ret6; [L489-L493] COND FALSE !(0 != ~tmp___0~1) [L255] havoc ~__retres1~2; [L258] COND FALSE !(1 == ~C_1_pc~0) [L268] COND FALSE !(2 == ~C_1_pc~0) [L278] ~__retres1~2 := 0; [L280] #res := ~__retres1~2; [L495] ~tmp___1~1 := #t~ret7; [L495] havoc #t~ret7; [L497-L501] COND FALSE !(0 != ~tmp___1~1) [L551-L588] COND FALSE !(false) [L554] ~kernel_st~0 := 1; [L340] havoc ~tmp~0; [L341] havoc ~tmp___0~0; [L342] havoc ~tmp___1~0; [L343] havoc ~tmp___2~0; [L15] int max_loop ; [L16] int clk ; [L17] int num ; [L18] int i ; [L19] int e ; [L20] int timer ; [L21] char data_0 ; [L22] char data_1 ; [L65] int P_1_pc; [L66] int P_1_st ; [L67] int P_1_i ; [L68] int P_1_ev ; [L123] int P_2_pc ; [L124] int P_2_st ; [L125] int P_2_i ; [L126] int P_2_ev ; [L191] int C_1_pc ; [L192] int C_1_st ; [L193] int C_1_i ; [L194] int C_1_ev ; [L195] int C_1_pr ; [L607] int count ; [L608] int __retres2 ; [L612] num = 0 [L613] i = 0 [L614] clk = 0 [L615] max_loop = 8 [L617] timer = 0 [L618] P_1_pc = 0 [L619] P_2_pc = 0 [L620] C_1_pc = 0 [L622] count = 0 [L599] P_1_i = 1 [L600] P_2_i = 1 [L601] C_1_i = 1 [L537] int kernel_st ; [L538] int tmp ; [L539] int tmp___0 ; [L543] kernel_st = 0 [L295] COND TRUE (int )P_1_i == 1 [L296] P_1_st = 0 [L300] COND TRUE (int )P_2_i == 1 [L301] P_2_st = 0 [L305] COND TRUE (int )C_1_i == 1 [L306] C_1_st = 0 [L473] int tmp ; [L474] int tmp___0 ; [L475] int tmp___1 ; [L105] int __retres1 ; [L108] COND FALSE !((int )P_1_pc == 1) [L118] __retres1 = 0 [L120] return (__retres1); [L479] tmp = is_P_1_triggered() [L481] COND FALSE !(\read(tmp)) [L173] int __retres1 ; [L176] COND FALSE !((int )P_2_pc == 1) [L186] __retres1 = 0 [L188] return (__retres1); [L487] tmp___0 = is_P_2_triggered() [L489] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; [L258] COND FALSE !((int )C_1_pc == 1) [L268] COND FALSE !((int )C_1_pc == 2) [L278] __retres1 = 0 [L280] return (__retres1); [L495] tmp___1 = is_C_1_triggered() [L497] COND FALSE !(\read(tmp___1)) [L551] COND TRUE 1 [L554] kernel_st = 1 [L340] int tmp ; [L341] int tmp___0 ; [L342] int tmp___1 ; [L343] int tmp___2 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; [?] assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [?] eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; [?] assume 0 != eval_~tmp___2~0; [?] assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume !(0 != eval_~tmp___1~0); [L347-L402] assume !false; [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318-L333] assume 0 == ~P_1_st~0; [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] assume 0 != eval_~tmp___2~0; [L357-L371] assume 0 == ~P_1_st~0; [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] assume !(0 != eval_~tmp~0); [L372-L386] assume 0 == ~P_2_st~0; [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] assume !(0 != eval_~tmp___0~0); [L387-L401] assume 0 == ~C_1_st~0; [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] assume !(0 != eval_~tmp___1~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L347-L402] assume !false; [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318-L333] assume 0 == ~P_1_st~0; [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] assume 0 != eval_~tmp___2~0; [L357-L371] assume 0 == ~P_1_st~0; [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] assume !(0 != eval_~tmp~0); [L372-L386] assume 0 == ~P_2_st~0; [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] assume !(0 != eval_~tmp___0~0); [L387-L401] assume 0 == ~C_1_st~0; [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] assume !(0 != eval_~tmp___1~0); [L347-L402] COND FALSE !(false) [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] COND TRUE 0 != eval_~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] COND FALSE !(0 != eval_~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] COND FALSE !(0 != eval_~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] COND FALSE !(0 != eval_~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L347-L402] COND FALSE !(false) [L350] havoc exists_runnable_thread_#res; [L350] havoc exists_runnable_thread_~__retres1~3; [L315] havoc exists_runnable_thread_~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] exists_runnable_thread_~__retres1~3 := 1; [L336] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L350] eval_#t~ret1 := exists_runnable_thread_#res; [L350] eval_~tmp___2~0 := eval_#t~ret1; [L350] havoc eval_#t~ret1; [L352-L356] COND TRUE 0 != eval_~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] eval_~tmp~0 := eval_#t~nondet2; [L359] havoc eval_#t~nondet2; [L361-L368] COND FALSE !(0 != eval_~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] eval_~tmp___0~0 := eval_#t~nondet3; [L374] havoc eval_#t~nondet3; [L376-L383] COND FALSE !(0 != eval_~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] eval_~tmp___1~0 := eval_#t~nondet4; [L389] havoc eval_#t~nondet4; [L391-L398] COND FALSE !(0 != eval_~tmp___1~0) [L347-L402] COND FALSE !(false) [L315] havoc ~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] ~__retres1~3 := 1; [L336] #res := ~__retres1~3; [L350] ~tmp___2~0 := #t~ret1; [L350] havoc #t~ret1; [L352-L356] COND TRUE 0 != ~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] ~tmp~0 := #t~nondet2; [L359] havoc #t~nondet2; [L361-L368] COND FALSE !(0 != ~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] ~tmp___0~0 := #t~nondet3; [L374] havoc #t~nondet3; [L376-L383] COND FALSE !(0 != ~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] ~tmp___1~0 := #t~nondet4; [L389] havoc #t~nondet4; [L391-L398] COND FALSE !(0 != ~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L347-L402] COND FALSE !(false) [L315] havoc ~__retres1~3; [L318] COND TRUE 0 == ~P_1_st~0 [L319] ~__retres1~3 := 1; [L336] #res := ~__retres1~3; [L350] ~tmp___2~0 := #t~ret1; [L350] havoc #t~ret1; [L352-L356] COND TRUE 0 != ~tmp___2~0 [L357] COND TRUE 0 == ~P_1_st~0 [L359] ~tmp~0 := #t~nondet2; [L359] havoc #t~nondet2; [L361-L368] COND FALSE !(0 != ~tmp~0) [L372] COND TRUE 0 == ~P_2_st~0 [L374] ~tmp___0~0 := #t~nondet3; [L374] havoc #t~nondet3; [L376-L383] COND FALSE !(0 != ~tmp___0~0) [L387] COND TRUE 0 == ~C_1_st~0 [L389] ~tmp___1~0 := #t~nondet4; [L389] havoc #t~nondet4; [L391-L398] COND FALSE !(0 != ~tmp___1~0) [L347] COND TRUE 1 [L315] int __retres1 ; [L318] COND TRUE (int )P_1_st == 0 [L319] __retres1 = 1 [L336] return (__retres1); [L350] tmp___2 = exists_runnable_thread() [L352] COND TRUE \read(tmp___2) [L357] COND TRUE (int )P_1_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) [L372] COND TRUE (int )P_2_st == 0 [L374] tmp___0 = __VERIFIER_nondet_int() [L376] COND FALSE !(\read(tmp___0)) [L387] COND TRUE (int )C_1_st == 0 [L389] tmp___1 = __VERIFIER_nondet_int() [L391] COND FALSE !(\read(tmp___1)) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int clk ; [L17] int num ; [L18] int i ; [L19] int e ; [L20] int timer ; [L21] char data_0 ; [L22] char data_1 ; [L65] int P_1_pc; [L66] int P_1_st ; [L67] int P_1_i ; [L68] int P_1_ev ; [L123] int P_2_pc ; [L124] int P_2_st ; [L125] int P_2_i ; [L126] int P_2_ev ; [L191] int C_1_pc ; [L192] int C_1_st ; [L193] int C_1_i ; [L194] int C_1_ev ; [L195] int C_1_pr ; [L607] int count ; [L608] int __retres2 ; [L612] num = 0 [L613] i = 0 [L614] clk = 0 [L615] max_loop = 8 [L617] timer = 0 [L618] P_1_pc = 0 [L619] P_2_pc = 0 [L620] C_1_pc = 0 [L622] count = 0 [L599] P_1_i = 1 [L600] P_2_i = 1 [L601] C_1_i = 1 [L537] int kernel_st ; [L538] int tmp ; [L539] int tmp___0 ; [L543] kernel_st = 0 [L295] COND TRUE (int )P_1_i == 1 [L296] P_1_st = 0 [L300] COND TRUE (int )P_2_i == 1 [L301] P_2_st = 0 [L305] COND TRUE (int )C_1_i == 1 [L306] C_1_st = 0 [L473] int tmp ; [L474] int tmp___0 ; [L475] int tmp___1 ; [L105] int __retres1 ; [L108] COND FALSE !((int )P_1_pc == 1) [L118] __retres1 = 0 [L120] return (__retres1); [L479] tmp = is_P_1_triggered() [L481] COND FALSE !(\read(tmp)) [L173] int __retres1 ; [L176] COND FALSE !((int )P_2_pc == 1) [L186] __retres1 = 0 [L188] return (__retres1); [L487] tmp___0 = is_P_2_triggered() [L489] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; [L258] COND FALSE !((int )C_1_pc == 1) [L268] COND FALSE !((int )C_1_pc == 2) [L278] __retres1 = 0 [L280] return (__retres1); [L495] tmp___1 = is_C_1_triggered() [L497] COND FALSE !(\read(tmp___1)) [L551] COND TRUE 1 [L554] kernel_st = 1 [L340] int tmp ; [L341] int tmp___0 ; [L342] int tmp___1 ; [L343] int tmp___2 ; Loop: [L347] COND TRUE 1 [L315] int __retres1 ; [L318] COND TRUE (int )P_1_st == 0 [L319] __retres1 = 1 [L336] return (__retres1); [L350] tmp___2 = exists_runnable_thread() [L352] COND TRUE \read(tmp___2) [L357] COND TRUE (int )P_1_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) [L372] COND TRUE (int )P_2_st == 0 [L374] tmp___0 = __VERIFIER_nondet_int() [L376] COND FALSE !(\read(tmp___0)) [L387] COND TRUE (int )C_1_st == 0 [L389] tmp___1 = __VERIFIER_nondet_int() [L391] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...