./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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 df684da5e5a56662a7be6091ec5bb0a21e1453c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-5842f4b [2018-11-18 10:23:27,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:23:27,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:23:27,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:23:27,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:23:27,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:23:27,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:23:27,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:23:27,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:23:27,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:23:27,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:23:27,718 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:23:27,719 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:23:27,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:23:27,721 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:23:27,722 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:23:27,722 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:23:27,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:23:27,725 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:23:27,726 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:23:27,727 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:23:27,728 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:23:27,730 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:23:27,730 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:23:27,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:23:27,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:23:27,731 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:23:27,732 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:23:27,733 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:23:27,734 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:23:27,734 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:23:27,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:23:27,735 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:23:27,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:23:27,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:23:27,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:23:27,737 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:23:27,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:23:27,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:23:27,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:23:27,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:23:27,749 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:23:27,749 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:23:27,750 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:23:27,750 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:23:27,750 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:23:27,750 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:23:27,750 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:23:27,750 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:23:27,750 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:23:27,751 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:23:27,751 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:23:27,751 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:23:27,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:23:27,751 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:23:27,751 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:23:27,751 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:23:27,751 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:23:27,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:23:27,752 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:23:27,752 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:23:27,752 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:23:27,752 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:23:27,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:23:27,754 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:23:27,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:23:27,755 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:23:27,755 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:23:27,756 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:23:27,756 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_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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 -> df684da5e5a56662a7be6091ec5bb0a21e1453c5 [2018-11-18 10:23:27,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:23:27,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:23:27,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:23:27,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:23:27,792 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:23:27,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c [2018-11-18 10:23:27,828 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/data/015566fec/33a50d1b772040a7add04d8b38acb429/FLAG2b6daf516 [2018-11-18 10:23:28,226 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:23:28,227 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/sv-benchmarks/c/systemc/pc_sfifo_2_false-unreach-call_false-termination.cil.c [2018-11-18 10:23:28,232 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/data/015566fec/33a50d1b772040a7add04d8b38acb429/FLAG2b6daf516 [2018-11-18 10:23:28,243 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/data/015566fec/33a50d1b772040a7add04d8b38acb429 [2018-11-18 10:23:28,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:23:28,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:23:28,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:23:28,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:23:28,250 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:23:28,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7217af06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28, skipping insertion in model container [2018-11-18 10:23:28,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:23:28,283 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:23:28,399 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:23:28,403 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:23:28,423 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:23:28,434 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:23:28,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28 WrapperNode [2018-11-18 10:23:28,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:23:28,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:23:28,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:23:28,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:23:28,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:23:28,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:23:28,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:23:28,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:23:28,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... [2018-11-18 10:23:28,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:23:28,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:23:28,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:23:28,530 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:23:28,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:28,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:23:28,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:23:28,895 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:23:28,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:23:28 BoogieIcfgContainer [2018-11-18 10:23:28,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:23:28,896 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:23:28,896 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:23:28,899 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:23:28,899 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:23:28,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:23:28" (1/3) ... [2018-11-18 10:23:28,900 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@706d12ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:23:28, skipping insertion in model container [2018-11-18 10:23:28,901 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:23:28,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:23:28" (2/3) ... [2018-11-18 10:23:28,901 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@706d12ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:23:28, skipping insertion in model container [2018-11-18 10:23:28,901 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:23:28,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:23:28" (3/3) ... [2018-11-18 10:23:28,903 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_2_false-unreach-call_false-termination.cil.c [2018-11-18 10:23:28,952 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:23:28,953 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:23:28,953 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:23:28,953 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:23:28,953 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:23:28,953 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:23:28,953 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:23:28,953 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:23:28,954 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:23:28,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states. [2018-11-18 10:23:28,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-11-18 10:23:28,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:28,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:28,993 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] [2018-11-18 10:23:28,993 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] [2018-11-18 10:23:28,993 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:23:28,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states. [2018-11-18 10:23:28,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-11-18 10:23:28,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:28,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:28,998 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] [2018-11-18 10:23:28,998 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] [2018-11-18 10:23:29,003 INFO L794 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 37#L452true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 51#L212true assume !(1 == ~q_req_up~0); 48#L212-2true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 19#L227true assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 16#L227-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 26#L232-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 28#L265true assume !(0 == ~q_read_ev~0); 27#L265-2true assume !(0 == ~q_write_ev~0); 60#L270-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 76#L55true assume !(1 == ~p_dw_pc~0); 71#L55-2true is_do_write_p_triggered_~__retres1~0 := 0; 77#L66true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 35#L67true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 95#L305true assume !(0 != activate_threads_~tmp~1); 99#L305-2true assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 90#L74true assume 1 == ~c_dr_pc~0; 42#L75true assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 91#L85true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 43#L86true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 100#L313true assume !(0 != activate_threads_~tmp___0~1); 101#L313-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 83#L283true assume !(1 == ~q_read_ev~0); 98#L283-2true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 8#L288-1true assume { :end_inline_reset_delta_events } true; 6#L409-3true [2018-11-18 10:23:29,004 INFO L796 eck$LassoCheckResult]: Loop: 6#L409-3true assume true; 3#L409-1true assume !false; 79#L410true start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4#L354true assume !true; 17#L370true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 47#L212-3true assume !(1 == ~q_req_up~0); 46#L212-5true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 23#L265-3true assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 36#L265-5true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 54#L270-3true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 52#L55-3true assume 1 == ~p_dw_pc~0; 32#L56-1true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 75#L66-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 33#L67-1true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 82#L305-3true assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 85#L305-5true assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 66#L74-3true assume !(1 == ~c_dr_pc~0); 64#L74-5true is_do_read_c_triggered_~__retres1~1 := 0; 69#L85-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 40#L86-1true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 103#L313-3true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 89#L313-5true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 97#L283-3true assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 93#L283-5true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 104#L288-3true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 53#L245-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 30#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 110#L258-1true stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 13#L384true assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 57#L391true stop_simulation_#res := stop_simulation_~__retres2~0; 15#L392true start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 107#L426true assume !(0 != start_simulation_~tmp~4); 6#L409-3true [2018-11-18 10:23:29,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,008 INFO L82 PathProgramCache]: Analyzing trace with hash -239976594, now seen corresponding path program 1 times [2018-11-18 10:23:29,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,109 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-18 10:23:29,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:29,115 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:29,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1229276384, now seen corresponding path program 1 times [2018-11-18 10:23:29,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,125 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-18 10:23:29,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:23:29,126 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:29,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:29,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:29,139 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2018-11-18 10:23:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:29,157 INFO L93 Difference]: Finished difference Result 106 states and 148 transitions. [2018-11-18 10:23:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:29,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 148 transitions. [2018-11-18 10:23:29,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-18 10:23:29,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 99 states and 141 transitions. [2018-11-18 10:23:29,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2018-11-18 10:23:29,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2018-11-18 10:23:29,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 141 transitions. [2018-11-18 10:23:29,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:23:29,169 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 141 transitions. [2018-11-18 10:23:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 141 transitions. [2018-11-18 10:23:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-18 10:23:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 10:23:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2018-11-18 10:23:29,193 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 141 transitions. [2018-11-18 10:23:29,193 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 141 transitions. [2018-11-18 10:23:29,193 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:23:29,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 141 transitions. [2018-11-18 10:23:29,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-18 10:23:29,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:29,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:29,195 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] [2018-11-18 10:23:29,195 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] [2018-11-18 10:23:29,196 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 231#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 232#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 277#L212 assume !(1 == ~q_req_up~0); 296#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 249#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 243#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 244#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 260#L265 assume !(0 == ~q_read_ev~0); 261#L265-2 assume !(0 == ~q_write_ev~0); 262#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 303#L55 assume !(1 == ~p_dw_pc~0); 273#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 272#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 274#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 275#L305 assume !(0 != activate_threads_~tmp~1); 320#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 317#L74 assume 1 == ~c_dr_pc~0; 286#L75 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 287#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 289#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 290#L313 assume !(0 != activate_threads_~tmp___0~1); 322#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 312#L283 assume !(1 == ~q_read_ev~0); 313#L283-2 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 233#L288-1 assume { :end_inline_reset_delta_events } true; 230#L409-3 [2018-11-18 10:23:29,196 INFO L796 eck$LassoCheckResult]: Loop: 230#L409-3 assume true; 224#L409-1 assume !false; 225#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 226#L354 assume true; 227#L329-1 assume !false; 234#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 308#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 251#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 265#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 252#L334 assume !(0 != eval_~tmp___1~0); 245#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 246#L212-3 assume !(1 == ~q_req_up~0); 294#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 257#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 258#L265-5 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 276#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 298#L55-3 assume 1 == ~p_dw_pc~0; 266#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 267#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 269#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 270#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 311#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 306#L74-3 assume 1 == ~c_dr_pc~0; 280#L75-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 281#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 283#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 284#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 315#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 316#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 318#L283-5 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 319#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 299#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 248#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 264#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 237#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 238#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 241#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 242#L426 assume !(0 != start_simulation_~tmp~4); 230#L409-3 [2018-11-18 10:23:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 577671856, now seen corresponding path program 1 times [2018-11-18 10:23:29,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:29,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:29,236 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:29,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash 60811614, now seen corresponding path program 1 times [2018-11-18 10:23:29,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,280 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-18 10:23:29,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:23:29,281 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:29,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:29,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:29,282 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. cyclomatic complexity: 43 Second operand 3 states. [2018-11-18 10:23:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:29,309 INFO L93 Difference]: Finished difference Result 162 states and 227 transitions. [2018-11-18 10:23:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:29,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 227 transitions. [2018-11-18 10:23:29,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 129 [2018-11-18 10:23:29,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 227 transitions. [2018-11-18 10:23:29,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2018-11-18 10:23:29,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-18 10:23:29,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 227 transitions. [2018-11-18 10:23:29,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:23:29,313 INFO L705 BuchiCegarLoop]: Abstraction has 162 states and 227 transitions. [2018-11-18 10:23:29,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 227 transitions. [2018-11-18 10:23:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2018-11-18 10:23:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-18 10:23:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2018-11-18 10:23:29,318 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 220 transitions. [2018-11-18 10:23:29,319 INFO L608 BuchiCegarLoop]: Abstraction has 156 states and 220 transitions. [2018-11-18 10:23:29,319 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:23:29,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 220 transitions. [2018-11-18 10:23:29,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 123 [2018-11-18 10:23:29,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:29,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:29,320 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] [2018-11-18 10:23:29,321 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] [2018-11-18 10:23:29,321 INFO L794 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 502#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 549#L212 assume !(1 == ~q_req_up~0); 565#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 520#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 514#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 515#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 532#L265 assume !(0 == ~q_read_ev~0); 533#L265-2 assume !(0 == ~q_write_ev~0); 534#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 572#L55 assume !(1 == ~p_dw_pc~0); 545#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 544#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 546#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 547#L305 assume !(0 != activate_threads_~tmp~1); 592#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 589#L74 assume !(1 == ~c_dr_pc~0); 578#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 579#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 558#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 559#L313 assume !(0 != activate_threads_~tmp___0~1); 594#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 584#L283 assume !(1 == ~q_read_ev~0); 585#L283-2 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 503#L288-1 assume { :end_inline_reset_delta_events } true; 504#L409-3 [2018-11-18 10:23:29,321 INFO L796 eck$LassoCheckResult]: Loop: 504#L409-3 assume true; 626#L409-1 assume !false; 625#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 599#L354 assume true; 624#L329-1 assume !false; 623#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 618#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 613#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 610#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 606#L334 assume !(0 != eval_~tmp___1~0); 516#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 517#L212-3 assume !(1 == ~q_req_up~0); 563#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 529#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 530#L265-5 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 548#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 567#L55-3 assume 1 == ~p_dw_pc~0; 538#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 539#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 541#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 542#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 583#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 575#L74-3 assume !(1 == ~c_dr_pc~0); 576#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 649#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 648#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 647#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 646#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 645#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 644#L283-5 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 643#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 642#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 640#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 639#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 638#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 637#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 636#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 628#L426 assume !(0 != start_simulation_~tmp~4); 504#L409-3 [2018-11-18 10:23:29,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647375, now seen corresponding path program 1 times [2018-11-18 10:23:29,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,348 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-18 10:23:29,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:29,348 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:29,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1237415933, now seen corresponding path program 1 times [2018-11-18 10:23:29,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,382 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-18 10:23:29,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:23:29,383 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:29,383 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. cyclomatic complexity: 66 Second operand 3 states. [2018-11-18 10:23:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:29,412 INFO L93 Difference]: Finished difference Result 307 states and 426 transitions. [2018-11-18 10:23:29,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:29,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 426 transitions. [2018-11-18 10:23:29,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2018-11-18 10:23:29,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 307 states and 426 transitions. [2018-11-18 10:23:29,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2018-11-18 10:23:29,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2018-11-18 10:23:29,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 426 transitions. [2018-11-18 10:23:29,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:23:29,420 INFO L705 BuchiCegarLoop]: Abstraction has 307 states and 426 transitions. [2018-11-18 10:23:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 426 transitions. [2018-11-18 10:23:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-18 10:23:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-18 10:23:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 426 transitions. [2018-11-18 10:23:29,431 INFO L728 BuchiCegarLoop]: Abstraction has 307 states and 426 transitions. [2018-11-18 10:23:29,431 INFO L608 BuchiCegarLoop]: Abstraction has 307 states and 426 transitions. [2018-11-18 10:23:29,431 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:23:29,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 426 transitions. [2018-11-18 10:23:29,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2018-11-18 10:23:29,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:29,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:29,434 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] [2018-11-18 10:23:29,435 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] [2018-11-18 10:23:29,435 INFO L794 eck$LassoCheckResult]: Stem: 1060#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 973#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 974#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 1024#L212 assume !(1 == ~q_req_up~0); 1041#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 991#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 985#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 986#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1004#L265 assume !(0 == ~q_read_ev~0); 1245#L265-2 assume !(0 == ~q_write_ev~0); 1244#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1243#L55 assume !(1 == ~p_dw_pc~0); 1241#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1240#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1239#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1238#L305 assume !(0 != activate_threads_~tmp~1); 1237#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1069#L74 assume !(1 == ~c_dr_pc~0); 1057#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 1058#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1070#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1231#L313 assume !(0 != activate_threads_~tmp___0~1); 1229#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1063#L283 assume !(1 == ~q_read_ev~0); 1064#L283-2 assume !(1 == ~q_write_ev~0); 975#L288-1 assume { :end_inline_reset_delta_events } true; 972#L409-3 [2018-11-18 10:23:29,435 INFO L796 eck$LassoCheckResult]: Loop: 972#L409-3 assume true; 966#L409-1 assume !false; 967#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 968#L354 assume true; 969#L329-1 assume !false; 976#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1059#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 993#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1011#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 994#L334 assume !(0 != eval_~tmp___1~0); 987#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 988#L212-3 assume !(1 == ~q_req_up~0); 1039#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1000#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1001#L265-5 assume !(0 == ~q_write_ev~0); 1266#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1265#L55-3 assume !(1 == ~p_dw_pc~0); 1264#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 1262#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1261#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1260#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 1259#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1055#L74-3 assume !(1 == ~c_dr_pc~0); 1052#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1053#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1029#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1030#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1067#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1068#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1072#L283-5 assume !(1 == ~q_write_ev~0); 1073#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1044#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 990#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1010#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 979#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 980#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 983#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 984#L426 assume !(0 != start_simulation_~tmp~4); 972#L409-3 [2018-11-18 10:23:29,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 1 times [2018-11-18 10:23:29,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1670074140, now seen corresponding path program 1 times [2018-11-18 10:23:29,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,503 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-18 10:23:29,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:23:29,503 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:29,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:23:29,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:23:29,504 INFO L87 Difference]: Start difference. First operand 307 states and 426 transitions. cyclomatic complexity: 121 Second operand 5 states. [2018-11-18 10:23:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:29,571 INFO L93 Difference]: Finished difference Result 471 states and 634 transitions. [2018-11-18 10:23:29,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:23:29,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 634 transitions. [2018-11-18 10:23:29,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 406 [2018-11-18 10:23:29,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 471 states and 634 transitions. [2018-11-18 10:23:29,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 471 [2018-11-18 10:23:29,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 471 [2018-11-18 10:23:29,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 634 transitions. [2018-11-18 10:23:29,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:23:29,578 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 634 transitions. [2018-11-18 10:23:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 634 transitions. [2018-11-18 10:23:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 319. [2018-11-18 10:23:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-18 10:23:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 438 transitions. [2018-11-18 10:23:29,589 INFO L728 BuchiCegarLoop]: Abstraction has 319 states and 438 transitions. [2018-11-18 10:23:29,589 INFO L608 BuchiCegarLoop]: Abstraction has 319 states and 438 transitions. [2018-11-18 10:23:29,589 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:23:29,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 319 states and 438 transitions. [2018-11-18 10:23:29,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 258 [2018-11-18 10:23:29,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:29,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:29,592 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] [2018-11-18 10:23:29,592 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] [2018-11-18 10:23:29,592 INFO L794 eck$LassoCheckResult]: Stem: 1858#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1767#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1768#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 1819#L212 assume !(1 == ~q_req_up~0); 1837#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1903#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1902#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1798#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1799#L265 assume !(0 == ~q_read_ev~0); 1802#L265-2 assume !(0 == ~q_write_ev~0); 1900#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1860#L55 assume !(1 == ~p_dw_pc~0); 1814#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1813#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1897#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1879#L305 assume !(0 != activate_threads_~tmp~1); 1880#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1873#L74 assume !(1 == ~c_dr_pc~0); 1855#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 1856#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1827#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1828#L313 assume !(0 != activate_threads_~tmp___0~1); 1889#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1890#L283 assume !(1 == ~q_read_ev~0); 1884#L283-2 assume !(1 == ~q_write_ev~0); 1769#L288-1 assume { :end_inline_reset_delta_events } true; 1766#L409-3 [2018-11-18 10:23:29,592 INFO L796 eck$LassoCheckResult]: Loop: 1766#L409-3 assume true; 1760#L409-1 assume !false; 1761#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 1862#L354 assume true; 1971#L329-1 assume !false; 1968#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1966#L245 assume !(0 == ~p_dw_st~0); 1962#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 1958#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1954#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 1952#L334 assume !(0 != eval_~tmp___1~0); 1951#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 1949#L212-3 assume !(1 == ~q_req_up~0); 1947#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1946#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1817#L265-5 assume !(0 == ~q_write_ev~0); 1818#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1838#L55-3 assume !(1 == ~p_dw_pc~0); 1840#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 1909#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1910#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1905#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 1906#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1853#L74-3 assume !(1 == ~c_dr_pc~0); 1850#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1851#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1824#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1825#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1871#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1872#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1876#L283-5 assume !(1 == ~q_write_ev~0); 1877#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1841#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1784#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1805#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1773#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 1774#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 1777#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1778#L426 assume !(0 != start_simulation_~tmp~4); 1766#L409-3 [2018-11-18 10:23:29,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 2 times [2018-11-18 10:23:29,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2083837260, now seen corresponding path program 1 times [2018-11-18 10:23:29,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,660 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-18 10:23:29,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:23:29,660 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:29,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:23:29,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:23:29,661 INFO L87 Difference]: Start difference. First operand 319 states and 438 transitions. cyclomatic complexity: 121 Second operand 5 states. [2018-11-18 10:23:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:29,719 INFO L93 Difference]: Finished difference Result 853 states and 1156 transitions. [2018-11-18 10:23:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:23:29,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 853 states and 1156 transitions. [2018-11-18 10:23:29,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 738 [2018-11-18 10:23:29,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 853 states to 853 states and 1156 transitions. [2018-11-18 10:23:29,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 853 [2018-11-18 10:23:29,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 853 [2018-11-18 10:23:29,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 853 states and 1156 transitions. [2018-11-18 10:23:29,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:23:29,728 INFO L705 BuchiCegarLoop]: Abstraction has 853 states and 1156 transitions. [2018-11-18 10:23:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states and 1156 transitions. [2018-11-18 10:23:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 337. [2018-11-18 10:23:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-18 10:23:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 456 transitions. [2018-11-18 10:23:29,740 INFO L728 BuchiCegarLoop]: Abstraction has 337 states and 456 transitions. [2018-11-18 10:23:29,740 INFO L608 BuchiCegarLoop]: Abstraction has 337 states and 456 transitions. [2018-11-18 10:23:29,740 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:23:29,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 337 states and 456 transitions. [2018-11-18 10:23:29,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 270 [2018-11-18 10:23:29,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:29,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:29,743 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] [2018-11-18 10:23:29,743 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] [2018-11-18 10:23:29,743 INFO L794 eck$LassoCheckResult]: Stem: 3048#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2952#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2953#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 3006#L212 assume !(1 == ~q_req_up~0); 3021#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2971#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2972#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2985#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2986#L265 assume !(0 == ~q_read_ev~0); 2987#L265-2 assume !(0 == ~q_write_ev~0); 2988#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3049#L55 assume !(1 == ~p_dw_pc~0); 3050#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 3219#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3217#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3215#L305 assume !(0 != activate_threads_~tmp~1); 3206#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3063#L74 assume !(1 == ~c_dr_pc~0); 3044#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 3045#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3014#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3015#L313 assume !(0 != activate_threads_~tmp___0~1); 3074#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3056#L283 assume !(1 == ~q_read_ev~0); 3057#L283-2 assume !(1 == ~q_write_ev~0); 2954#L288-1 assume { :end_inline_reset_delta_events } true; 2955#L409-3 [2018-11-18 10:23:29,743 INFO L796 eck$LassoCheckResult]: Loop: 2955#L409-3 assume true; 3152#L409-1 assume !false; 3145#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 3141#L354 assume true; 3139#L329-1 assume !false; 3137#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3135#L245 assume !(0 == ~p_dw_st~0); 3132#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 3129#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3127#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 3124#L334 assume !(0 != eval_~tmp___1~0); 3119#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 3114#L212-3 assume !(1 == ~q_req_up~0); 3109#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 3107#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 3105#L265-5 assume !(0 == ~q_write_ev~0); 3028#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3029#L55-3 assume 1 == ~p_dw_pc~0; 2995#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 2996#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2998#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2999#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 3055#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3041#L74-3 assume !(1 == ~c_dr_pc~0); 3042#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 3223#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3221#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3207#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 3204#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3202#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 3194#L283-5 assume !(1 == ~q_write_ev~0); 3191#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3188#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3186#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3185#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3184#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3183#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 3175#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3169#L426 assume !(0 != start_simulation_~tmp~4); 2955#L409-3 [2018-11-18 10:23:29,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 3 times [2018-11-18 10:23:29,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2097743379, now seen corresponding path program 1 times [2018-11-18 10:23:29,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:29,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,806 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-18 10:23:29,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:23:29,806 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:29,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:23:29,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:23:29,807 INFO L87 Difference]: Start difference. First operand 337 states and 456 transitions. cyclomatic complexity: 121 Second operand 5 states. [2018-11-18 10:23:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:29,850 INFO L93 Difference]: Finished difference Result 582 states and 784 transitions. [2018-11-18 10:23:29,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:23:29,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 582 states and 784 transitions. [2018-11-18 10:23:29,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 515 [2018-11-18 10:23:29,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 582 states to 582 states and 784 transitions. [2018-11-18 10:23:29,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 582 [2018-11-18 10:23:29,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 582 [2018-11-18 10:23:29,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 582 states and 784 transitions. [2018-11-18 10:23:29,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:23:29,856 INFO L705 BuchiCegarLoop]: Abstraction has 582 states and 784 transitions. [2018-11-18 10:23:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states and 784 transitions. [2018-11-18 10:23:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 340. [2018-11-18 10:23:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 10:23:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 454 transitions. [2018-11-18 10:23:29,861 INFO L728 BuchiCegarLoop]: Abstraction has 340 states and 454 transitions. [2018-11-18 10:23:29,862 INFO L608 BuchiCegarLoop]: Abstraction has 340 states and 454 transitions. [2018-11-18 10:23:29,862 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:23:29,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 340 states and 454 transitions. [2018-11-18 10:23:29,863 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 273 [2018-11-18 10:23:29,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:29,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:29,864 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] [2018-11-18 10:23:29,864 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] [2018-11-18 10:23:29,864 INFO L794 eck$LassoCheckResult]: Stem: 3981#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 3886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 3887#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 3939#L212 assume !(1 == ~q_req_up~0); 3954#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3905#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 3899#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 3900#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 3922#L265 assume !(0 == ~q_read_ev~0); 3923#L265-2 assume !(0 == ~q_write_ev~0); 4032#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3982#L55 assume !(1 == ~p_dw_pc~0); 3935#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 4026#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4027#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4001#L305 assume !(0 != activate_threads_~tmp~1); 4002#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3995#L74 assume !(1 == ~c_dr_pc~0); 3974#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 3975#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3947#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3948#L313 assume !(0 != activate_threads_~tmp___0~1); 4010#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4011#L283 assume !(1 == ~q_read_ev~0); 4005#L283-2 assume !(1 == ~q_write_ev~0); 3888#L288-1 assume { :end_inline_reset_delta_events } true; 3889#L409-3 [2018-11-18 10:23:29,864 INFO L796 eck$LassoCheckResult]: Loop: 3889#L409-3 assume true; 4100#L409-1 assume !false; 4094#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 4089#L354 assume true; 4087#L329-1 assume !false; 4085#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4083#L245 assume !(0 == ~p_dw_st~0); 4080#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 4077#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4075#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 4072#L334 assume !(0 != eval_~tmp___1~0); 4067#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 4062#L212-3 assume !(1 == ~q_req_up~0); 4057#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 4055#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 4052#L265-5 assume !(0 == ~q_write_ev~0); 4053#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4047#L55-3 assume 1 == ~p_dw_pc~0; 4048#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 4042#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4043#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4039#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 3985#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3971#L74-3 assume !(1 == ~c_dr_pc~0); 3972#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 4149#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4147#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4145#L313-3 assume !(0 != activate_threads_~tmp___0~1); 4143#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4139#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 4134#L283-5 assume !(1 == ~q_write_ev~0); 4129#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4127#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4122#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4119#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 4117#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 4116#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 4115#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 4113#L426 assume !(0 != start_simulation_~tmp~4); 3889#L409-3 [2018-11-18 10:23:29,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 4 times [2018-11-18 10:23:29,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1839577941, now seen corresponding path program 1 times [2018-11-18 10:23:29,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:29,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:29,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1079327811, now seen corresponding path program 1 times [2018-11-18 10:23:29,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:29,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:29,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:29,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:29,924 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-18 10:23:29,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:29,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:30,061 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2018-11-18 10:23:30,111 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:30,111 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:30,112 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:30,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:30,112 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:23:30,112 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:30,112 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:30,112 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:30,112 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-18 10:23:30,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:30,113 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:30,128 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-18 10:23:30,131 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-18 10:23:30,134 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-18 10:23:30,135 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-18 10:23:30,144 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-18 10:23:30,146 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-18 10:23:30,152 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-18 10:23:30,153 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-18 10:23:30,155 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-18 10:23:30,157 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-18 10:23:30,159 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-18 10:23:30,161 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-18 10:23:30,168 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-18 10:23:30,174 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-18 10:23:30,176 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-18 10:23:30,180 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-18 10:23:30,182 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-18 10:23:30,185 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-18 10:23:30,188 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-18 10:23:30,190 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-18 10:23:30,191 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-18 10:23:30,193 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-18 10:23:30,195 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-18 10:23:30,358 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:30,359 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:30,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:30,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:30,367 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:30,368 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~2=0} Honda state: {ULTIMATE.start_eval_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:30,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:30,384 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:30,387 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:30,387 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:30,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:30,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:30,406 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:30,406 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret5=0} Honda state: {ULTIMATE.start_eval_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:30,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:30,434 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:30,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:23:30,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:30,472 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:23:30,488 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:30,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:30,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:30,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:30,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:23:30,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:30,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:30,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:30,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-18 10:23:30,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:30,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:30,492 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-18 10:23:30,496 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-18 10:23:30,501 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-18 10:23:30,502 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-18 10:23:30,506 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-18 10:23:30,507 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-18 10:23:30,508 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-18 10:23:30,510 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-18 10:23:30,512 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-18 10:23:30,521 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-18 10:23:30,537 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-18 10:23:30,543 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-18 10:23:30,546 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-18 10:23:30,548 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-18 10:23:30,550 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-18 10:23:30,552 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-18 10:23:30,553 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-18 10:23:30,554 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-18 10:23:30,557 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-18 10:23:30,561 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-18 10:23:30,562 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-18 10:23:30,564 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-18 10:23:30,565 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-18 10:23:30,738 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:30,742 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:23:30,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-18 10:23:30,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:30,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:30,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:30,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:30,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:30,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:30,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:30,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:30,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-18 10:23:30,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:30,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:30,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:30,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:30,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:30,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:30,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:30,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:30,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:30,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:30,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:30,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:30,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:30,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:30,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:30,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:30,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:30,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:30,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:30,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:30,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:30,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:30,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:30,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:30,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:30,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:23:30,760 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:23:30,760 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:23:30,762 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:23:30,762 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:23:30,762 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:23:30,763 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_read_ev~0) = -1*~q_read_ev~0 + 1 Supporting invariants [] [2018-11-18 10:23:30,763 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:23:30,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:30,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:30,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:30,855 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:23:30,855 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 340 states and 454 transitions. cyclomatic complexity: 116 Second operand 5 states. [2018-11-18 10:23:30,915 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 340 states and 454 transitions. cyclomatic complexity: 116. Second operand 5 states. Result 914 states and 1226 transitions. Complement of second has 5 states. [2018-11-18 10:23:30,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 10:23:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:23:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2018-11-18 10:23:30,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 141 transitions. Stem has 26 letters. Loop has 39 letters. [2018-11-18 10:23:30,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:30,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 141 transitions. Stem has 65 letters. Loop has 39 letters. [2018-11-18 10:23:30,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:30,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 141 transitions. Stem has 26 letters. Loop has 78 letters. [2018-11-18 10:23:30,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:30,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 914 states and 1226 transitions. [2018-11-18 10:23:30,928 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 546 [2018-11-18 10:23:30,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 914 states to 914 states and 1226 transitions. [2018-11-18 10:23:30,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 619 [2018-11-18 10:23:30,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 629 [2018-11-18 10:23:30,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 914 states and 1226 transitions. [2018-11-18 10:23:30,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:30,933 INFO L705 BuchiCegarLoop]: Abstraction has 914 states and 1226 transitions. [2018-11-18 10:23:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states and 1226 transitions. [2018-11-18 10:23:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 904. [2018-11-18 10:23:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-18 10:23:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1216 transitions. [2018-11-18 10:23:30,948 INFO L728 BuchiCegarLoop]: Abstraction has 904 states and 1216 transitions. [2018-11-18 10:23:30,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:30,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:30,949 INFO L87 Difference]: Start difference. First operand 904 states and 1216 transitions. Second operand 3 states. [2018-11-18 10:23:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:30,992 INFO L93 Difference]: Finished difference Result 1309 states and 1681 transitions. [2018-11-18 10:23:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:30,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1309 states and 1681 transitions. [2018-11-18 10:23:31,000 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 780 [2018-11-18 10:23:31,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1309 states to 1309 states and 1681 transitions. [2018-11-18 10:23:31,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 903 [2018-11-18 10:23:31,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 903 [2018-11-18 10:23:31,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1309 states and 1681 transitions. [2018-11-18 10:23:31,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:31,007 INFO L705 BuchiCegarLoop]: Abstraction has 1309 states and 1681 transitions. [2018-11-18 10:23:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states and 1681 transitions. [2018-11-18 10:23:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1309. [2018-11-18 10:23:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2018-11-18 10:23:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1681 transitions. [2018-11-18 10:23:31,026 INFO L728 BuchiCegarLoop]: Abstraction has 1309 states and 1681 transitions. [2018-11-18 10:23:31,026 INFO L608 BuchiCegarLoop]: Abstraction has 1309 states and 1681 transitions. [2018-11-18 10:23:31,026 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:23:31,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1309 states and 1681 transitions. [2018-11-18 10:23:31,031 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 780 [2018-11-18 10:23:31,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:31,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:31,032 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-18 10:23:31,032 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] [2018-11-18 10:23:31,032 INFO L794 eck$LassoCheckResult]: Stem: 7753#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 7577#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 7578#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 7670#L212 assume !(1 == ~q_req_up~0); 7713#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 7609#L227 assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 7610#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 7636#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 7637#L265 assume !(0 == ~q_read_ev~0); 7638#L265-2 assume !(0 == ~q_write_ev~0); 7639#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 8176#L55 assume !(1 == ~p_dw_pc~0); 8174#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 8173#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 8172#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 7783#L305 assume !(0 != activate_threads_~tmp~1); 7784#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 7773#L74 assume !(1 == ~c_dr_pc~0); 7744#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 7745#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 7689#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 7690#L313 assume !(0 != activate_threads_~tmp___0~1); 7797#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7761#L283 assume !(1 == ~q_read_ev~0); 7762#L283-2 assume !(1 == ~q_write_ev~0); 7579#L288-1 assume { :end_inline_reset_delta_events } true; 7580#L409-3 assume true; 8169#L409-1 [2018-11-18 10:23:31,032 INFO L796 eck$LassoCheckResult]: Loop: 8169#L409-1 assume !false; 8733#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 8680#L354 assume true; 8730#L329-1 assume !false; 8727#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8725#L245 assume !(0 == ~p_dw_st~0); 8716#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 8714#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8712#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 8709#L334 assume !(0 != eval_~tmp___1~0); 7601#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 7602#L212-3 assume !(1 == ~q_req_up~0); 7699#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 7628#L265-3 assume !(0 == ~q_read_ev~0); 7629#L265-5 assume !(0 == ~q_write_ev~0); 7668#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 7714#L55-3 assume 1 == ~p_dw_pc~0; 7653#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 7654#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 8868#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 8865#L305-3 assume !(0 != activate_threads_~tmp~1); 8766#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 8765#L74-3 assume !(1 == ~c_dr_pc~0); 8764#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 8762#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 8760#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 8758#L313-3 assume !(0 != activate_threads_~tmp___0~1); 8756#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 8754#L283-3 assume !(1 == ~q_read_ev~0); 8752#L283-5 assume !(1 == ~q_write_ev~0); 8749#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8747#L245-1 assume !(0 == ~p_dw_st~0); 8746#L249-1 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 8744#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8742#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8741#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 8740#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 8739#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8737#L426 assume !(0 != start_simulation_~tmp~4); 8736#L409-3 assume true; 8169#L409-1 [2018-11-18 10:23:31,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1611395687, now seen corresponding path program 1 times [2018-11-18 10:23:31,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:31,065 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-18 10:23:31,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:31,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:31,065 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:31,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1781247699, now seen corresponding path program 1 times [2018-11-18 10:23:31,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:31,077 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-18 10:23:31,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:31,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:31,078 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:31,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:31,078 INFO L87 Difference]: Start difference. First operand 1309 states and 1681 transitions. cyclomatic complexity: 378 Second operand 3 states. [2018-11-18 10:23:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:31,091 INFO L93 Difference]: Finished difference Result 1259 states and 1615 transitions. [2018-11-18 10:23:31,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:31,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1259 states and 1615 transitions. [2018-11-18 10:23:31,098 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 780 [2018-11-18 10:23:31,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1259 states to 1259 states and 1615 transitions. [2018-11-18 10:23:31,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 853 [2018-11-18 10:23:31,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 853 [2018-11-18 10:23:31,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1259 states and 1615 transitions. [2018-11-18 10:23:31,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:31,105 INFO L705 BuchiCegarLoop]: Abstraction has 1259 states and 1615 transitions. [2018-11-18 10:23:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states and 1615 transitions. [2018-11-18 10:23:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2018-11-18 10:23:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2018-11-18 10:23:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1615 transitions. [2018-11-18 10:23:31,123 INFO L728 BuchiCegarLoop]: Abstraction has 1259 states and 1615 transitions. [2018-11-18 10:23:31,123 INFO L608 BuchiCegarLoop]: Abstraction has 1259 states and 1615 transitions. [2018-11-18 10:23:31,123 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 10:23:31,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1259 states and 1615 transitions. [2018-11-18 10:23:31,127 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 780 [2018-11-18 10:23:31,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:31,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:31,128 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-18 10:23:31,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 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] [2018-11-18 10:23:31,128 INFO L794 eck$LassoCheckResult]: Stem: 10318#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 10152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 10153#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 10239#L212 assume !(1 == ~q_req_up~0); 10272#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 10184#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 10174#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 10175#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 10210#L265 assume !(0 == ~q_read_ev~0); 10211#L265-2 assume !(0 == ~q_write_ev~0); 10385#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10384#L55 assume !(1 == ~p_dw_pc~0); 10314#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 10315#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10235#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10236#L305 assume !(0 != activate_threads_~tmp~1); 10353#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10341#L74 assume !(1 == ~c_dr_pc~0); 10310#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 10311#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10258#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10259#L313 assume !(0 != activate_threads_~tmp___0~1); 10361#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 10327#L283 assume !(1 == ~q_read_ev~0); 10328#L283-2 assume !(1 == ~q_write_ev~0); 10358#L288-1 assume { :end_inline_reset_delta_events } true; 10561#L409-3 assume true; 10562#L409-1 [2018-11-18 10:23:31,128 INFO L796 eck$LassoCheckResult]: Loop: 10562#L409-1 assume !false; 11039#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 11036#L354 assume true; 11034#L329-1 assume !false; 11029#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11028#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10710#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11024#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 11022#L334 assume 0 != eval_~tmp___1~0; 11001#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 11002#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 10344#L118 assume 0 == ~p_dw_pc~0; 10159#L129-2 assume true; 10704#L129 assume !false; 10260#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 10261#L148 assume { :end_inline_do_write_p } true; 10252#L339 assume !(0 == ~c_dr_st~0); 10253#L354 assume true; 10716#L329-1 assume !false; 10714#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10709#L245 assume !(0 == ~p_dw_st~0); 10185#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 10187#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10963#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 10706#L334 assume !(0 != eval_~tmp___1~0); 10708#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 10977#L212-3 assume !(1 == ~q_req_up~0); 10978#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 11030#L265-3 assume !(0 == ~q_read_ev~0); 11027#L265-5 assume !(0 == ~q_write_ev~0); 11025#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 11023#L55-3 assume 1 == ~p_dw_pc~0; 11019#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 11020#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10965#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10966#L305-3 assume !(0 != activate_threads_~tmp~1); 10768#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10766#L74-3 assume !(1 == ~c_dr_pc~0); 10764#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 10762#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 10760#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10758#L313-3 assume !(0 != activate_threads_~tmp___0~1); 10756#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 10754#L283-3 assume !(1 == ~q_read_ev~0); 10751#L283-5 assume !(1 == ~q_write_ev~0); 10748#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10745#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 10747#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11051#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11049#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 11047#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 11046#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11044#L426 assume !(0 != start_simulation_~tmp~4); 11042#L409-3 assume true; 10562#L409-1 [2018-11-18 10:23:31,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1392540969, now seen corresponding path program 1 times [2018-11-18 10:23:31,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash 73375067, now seen corresponding path program 1 times [2018-11-18 10:23:31,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:23:31,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:31,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:23:31,184 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:23:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:23:31,184 INFO L87 Difference]: Start difference. First operand 1259 states and 1615 transitions. cyclomatic complexity: 362 Second operand 6 states. [2018-11-18 10:23:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:31,249 INFO L93 Difference]: Finished difference Result 1293 states and 1607 transitions. [2018-11-18 10:23:31,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:23:31,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1293 states and 1607 transitions. [2018-11-18 10:23:31,255 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 735 [2018-11-18 10:23:31,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1293 states to 1244 states and 1554 transitions. [2018-11-18 10:23:31,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 846 [2018-11-18 10:23:31,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 846 [2018-11-18 10:23:31,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1244 states and 1554 transitions. [2018-11-18 10:23:31,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:31,261 INFO L705 BuchiCegarLoop]: Abstraction has 1244 states and 1554 transitions. [2018-11-18 10:23:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states and 1554 transitions. [2018-11-18 10:23:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1244. [2018-11-18 10:23:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-11-18 10:23:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1554 transitions. [2018-11-18 10:23:31,277 INFO L728 BuchiCegarLoop]: Abstraction has 1244 states and 1554 transitions. [2018-11-18 10:23:31,277 INFO L608 BuchiCegarLoop]: Abstraction has 1244 states and 1554 transitions. [2018-11-18 10:23:31,277 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 10:23:31,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1244 states and 1554 transitions. [2018-11-18 10:23:31,281 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 735 [2018-11-18 10:23:31,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:31,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:31,282 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-18 10:23:31,282 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 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] [2018-11-18 10:23:31,282 INFO L794 eck$LassoCheckResult]: Stem: 12884#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 12717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 12718#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 12805#L212 assume !(1 == ~q_req_up~0); 12848#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 12980#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 12979#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 12774#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 12775#L265 assume !(0 == ~q_read_ev~0); 12776#L265-2 assume !(0 == ~q_write_ev~0); 12777#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12864#L55 assume !(1 == ~p_dw_pc~0); 12800#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 12883#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 12957#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 12955#L305 assume !(0 != activate_threads_~tmp~1); 12953#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 12951#L74 assume !(1 == ~c_dr_pc~0); 12949#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 12947#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 12945#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 12943#L313 assume !(0 != activate_threads_~tmp___0~1); 12941#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 12939#L283 assume !(1 == ~q_read_ev~0); 12895#L283-2 assume !(1 == ~q_write_ev~0); 12922#L288-1 assume { :end_inline_reset_delta_events } true; 13227#L409-3 assume true; 13228#L409-1 [2018-11-18 10:23:31,282 INFO L796 eck$LassoCheckResult]: Loop: 13228#L409-1 assume !false; 13896#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 13895#L354 assume true; 13893#L329-1 assume !false; 13892#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13890#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 13343#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13888#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13887#L334 assume 0 != eval_~tmp___1~0; 12765#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 12711#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 12712#L118 assume 0 == ~p_dw_pc~0; 13587#L129-2 assume true; 13586#L129 assume !false; 13584#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 13583#L148 assume { :end_inline_do_write_p } true; 13581#L339 assume !(0 == ~c_dr_st~0); 12707#L354 assume true; 12708#L329-1 assume !false; 13345#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13342#L245 assume !(0 == ~p_dw_st~0); 13339#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 13337#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13335#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 13332#L334 assume !(0 != eval_~tmp___1~0); 13327#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 12836#L212-3 assume !(1 == ~q_req_up~0); 12834#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 12767#L265-3 assume !(0 == ~q_read_ev~0); 12768#L265-5 assume !(0 == ~q_write_ev~0); 12803#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 12849#L55-3 assume !(1 == ~p_dw_pc~0); 12790#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 12842#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 12794#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 12795#L305-3 assume !(0 != activate_threads_~tmp~1); 12892#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 12873#L74-3 assume !(1 == ~c_dr_pc~0); 12866#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 12867#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 12815#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 12816#L313-3 assume !(0 != activate_threads_~tmp___0~1); 12899#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 12900#L283-3 assume !(1 == ~q_read_ev~0); 12908#L283-5 assume !(1 == ~q_write_ev~0); 12909#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13931#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 13903#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13902#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 13901#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 13900#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 13899#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 13898#L426 assume !(0 != start_simulation_~tmp~4); 13897#L409-3 assume true; 13228#L409-1 [2018-11-18 10:23:31,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1392540969, now seen corresponding path program 2 times [2018-11-18 10:23:31,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash 853355996, now seen corresponding path program 1 times [2018-11-18 10:23:31,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:31,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:31,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:31,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:31,319 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:31,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:31,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:31,319 INFO L87 Difference]: Start difference. First operand 1244 states and 1554 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-18 10:23:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:31,343 INFO L93 Difference]: Finished difference Result 1342 states and 1633 transitions. [2018-11-18 10:23:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:31,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1342 states and 1633 transitions. [2018-11-18 10:23:31,349 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 743 [2018-11-18 10:23:31,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1342 states to 1342 states and 1633 transitions. [2018-11-18 10:23:31,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 910 [2018-11-18 10:23:31,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 910 [2018-11-18 10:23:31,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1342 states and 1633 transitions. [2018-11-18 10:23:31,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:31,355 INFO L705 BuchiCegarLoop]: Abstraction has 1342 states and 1633 transitions. [2018-11-18 10:23:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states and 1633 transitions. [2018-11-18 10:23:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1326. [2018-11-18 10:23:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2018-11-18 10:23:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1613 transitions. [2018-11-18 10:23:31,371 INFO L728 BuchiCegarLoop]: Abstraction has 1326 states and 1613 transitions. [2018-11-18 10:23:31,371 INFO L608 BuchiCegarLoop]: Abstraction has 1326 states and 1613 transitions. [2018-11-18 10:23:31,371 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 10:23:31,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1326 states and 1613 transitions. [2018-11-18 10:23:31,375 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 735 [2018-11-18 10:23:31,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:31,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:31,376 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-18 10:23:31,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 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] [2018-11-18 10:23:31,376 INFO L794 eck$LassoCheckResult]: Stem: 15482#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 15309#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 15310#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 15400#L212 assume !(1 == ~q_req_up~0); 15447#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 15565#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 15336#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 15337#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 15367#L265 assume !(0 == ~q_read_ev~0); 15368#L265-2 assume !(0 == ~q_write_ev~0); 15369#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 15462#L55 assume 1 == ~p_dw_pc~0; 15391#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 15392#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 15649#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 15650#L305 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 15527#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 15528#L74 assume !(1 == ~c_dr_pc~0); 15632#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 15633#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 15628#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 15629#L313 assume !(0 != activate_threads_~tmp___0~1); 15620#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 15621#L283 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 15526#L283-2 assume !(1 == ~q_write_ev~0); 15311#L288-1 assume { :end_inline_reset_delta_events } true; 15312#L409-3 assume true; 16145#L409-1 [2018-11-18 10:23:31,377 INFO L796 eck$LassoCheckResult]: Loop: 16145#L409-1 assume !false; 16143#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 16141#L354 assume true; 16139#L329-1 assume !false; 16137#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16135#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 16125#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16132#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 16130#L334 assume 0 != eval_~tmp___1~0; 16129#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 16063#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 16126#L118 assume !(0 == ~p_dw_pc~0); 16123#L121 assume 1 == ~p_dw_pc~0; 16068#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; 16089#L129-2 assume true; 16087#L129 assume !false; 16067#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 16064#L148 assume { :end_inline_do_write_p } true; 16060#L339 assume !(0 == ~c_dr_st~0); 16058#L354 assume true; 16128#L329-1 assume !false; 16127#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16124#L245 assume !(0 == ~p_dw_st~0); 16121#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 16122#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16201#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 16199#L334 assume !(0 != eval_~tmp___1~0); 16196#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 16192#L212-3 assume !(1 == ~q_req_up~0); 16193#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 16372#L265-3 assume !(0 == ~q_read_ev~0); 15396#L265-5 assume !(0 == ~q_write_ev~0); 15397#L270-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 15442#L55-3 assume 1 == ~p_dw_pc~0; 15382#L56-1 assume !(1 == ~q_read_ev~0); 15383#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 15438#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 16391#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 15493#L305-3 assume !(0 != activate_threads_~tmp~1); 15494#L305-5 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 15470#L74-3 assume !(1 == ~c_dr_pc~0); 15471#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 16590#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 16588#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 16586#L313-3 assume !(0 != activate_threads_~tmp___0~1); 16584#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 16583#L283-3 assume !(1 == ~q_read_ev~0); 16157#L283-5 assume !(1 == ~q_write_ev~0); 16153#L288-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16150#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 16151#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16159#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 16158#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 16154#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 16152#L392 start_simulation_#t~ret9 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 16149#L426 assume !(0 != start_simulation_~tmp~4); 16147#L409-3 assume true; 16145#L409-1 [2018-11-18 10:23:31,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash -42288370, now seen corresponding path program 1 times [2018-11-18 10:23:31,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:31,397 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-18 10:23:31,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:31,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:31,398 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:31,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1736843849, now seen corresponding path program 1 times [2018-11-18 10:23:31,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:23:31,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:31,411 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:31,411 INFO L87 Difference]: Start difference. First operand 1326 states and 1613 transitions. cyclomatic complexity: 293 Second operand 3 states. [2018-11-18 10:23:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:31,425 INFO L93 Difference]: Finished difference Result 1288 states and 1566 transitions. [2018-11-18 10:23:31,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:31,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1288 states and 1566 transitions. [2018-11-18 10:23:31,432 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 743 [2018-11-18 10:23:31,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1288 states to 1288 states and 1566 transitions. [2018-11-18 10:23:31,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 856 [2018-11-18 10:23:31,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 856 [2018-11-18 10:23:31,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1288 states and 1566 transitions. [2018-11-18 10:23:31,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:31,438 INFO L705 BuchiCegarLoop]: Abstraction has 1288 states and 1566 transitions. [2018-11-18 10:23:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states and 1566 transitions. [2018-11-18 10:23:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1272. [2018-11-18 10:23:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-18 10:23:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1546 transitions. [2018-11-18 10:23:31,453 INFO L728 BuchiCegarLoop]: Abstraction has 1272 states and 1546 transitions. [2018-11-18 10:23:31,453 INFO L608 BuchiCegarLoop]: Abstraction has 1272 states and 1546 transitions. [2018-11-18 10:23:31,453 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 10:23:31,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1272 states and 1546 transitions. [2018-11-18 10:23:31,457 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 735 [2018-11-18 10:23:31,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:31,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:31,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:31,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:31,458 INFO L794 eck$LassoCheckResult]: Stem: 18097#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 17930#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 17931#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 18014#L212 assume !(1 == ~q_req_up~0); 18057#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 18166#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 18164#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 18162#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 18160#L265 assume !(0 == ~q_read_ev~0); 18158#L265-2 assume !(0 == ~q_write_ev~0); 18157#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 18156#L55 assume !(1 == ~p_dw_pc~0); 18155#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 18154#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 18153#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 18130#L305 assume !(0 != activate_threads_~tmp~1); 18131#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 18117#L74 assume !(1 == ~c_dr_pc~0); 18118#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 18150#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 18033#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 18034#L313 assume !(0 != activate_threads_~tmp___0~1); 18136#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 18107#L283 assume !(1 == ~q_read_ev~0); 18108#L283-2 assume !(1 == ~q_write_ev~0); 17932#L288-1 assume { :end_inline_reset_delta_events } true; 17933#L409-3 assume true; 18374#L409-1 assume !false; 19170#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 19169#L354 assume true; 19168#L329-1 assume !false; 19167#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 19166#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 19165#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 19164#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 19163#L334 assume 0 != eval_~tmp___1~0; 19162#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 19161#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 19160#L118 assume 0 == ~p_dw_pc~0; 19158#L129-2 [2018-11-18 10:23:31,458 INFO L796 eck$LassoCheckResult]: Loop: 19158#L129-2 assume true; 18127#L129 assume !false; 18128#L130 assume !(0 == ~q_free~0); 18100#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; 19158#L129-2 [2018-11-18 10:23:31,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2036845665, now seen corresponding path program 1 times [2018-11-18 10:23:31,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash 6470825, now seen corresponding path program 1 times [2018-11-18 10:23:31,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1381757255, now seen corresponding path program 1 times [2018-11-18 10:23:31,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:31,525 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:31,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:31,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:31,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:31,526 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:23:31,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:31,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:31,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:31,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2018-11-18 10:23:31,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:31,526 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:31,527 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-18 10:23:31,533 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-18 10:23:31,535 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-18 10:23:31,539 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-18 10:23:31,579 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:31,579 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:31,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:31,590 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:31,595 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:31,595 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~q_buf_0~0=-4, ~p_last_write~0=-4, ULTIMATE.start_do_write_p_#t~nondet2=-4} Honda state: {~q_buf_0~0=-4, ~p_last_write~0=-4, ULTIMATE.start_do_write_p_#t~nondet2=-4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:31,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:31,626 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:31,657 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:23:31,658 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:31,685 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:31,685 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=-2}, {~p_num_write~0=2}, {~p_num_write~0=1}] Lambdas: [2, 1, 1] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:31,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:31,714 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:31,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:23:31,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:31,779 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:23:31,781 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:31,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:31,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:31,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:31,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:23:31,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:31,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:31,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:31,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Loop [2018-11-18 10:23:31,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:31,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:31,783 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-18 10:23:31,821 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-18 10:23:31,858 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-18 10:23:31,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:31,901 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:31,902 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:23:31,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-18 10:23:31,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:31,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:31,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,906 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:31,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:31,906 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:31,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:31,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:31,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:31,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:31,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,914 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 10:23:31,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,916 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:23:31,916 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:23:31,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,919 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:31,919 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:23:31,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:31,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,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-18 10:23:31,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,924 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:23:31,925 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:23:31,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,927 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:23:31,927 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:23:31,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,929 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 10:23:31,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,930 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:31,931 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:31,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,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-18 10:23:31,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,934 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:31,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:31,935 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:23:31,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,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-18 10:23:31,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,940 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:31,940 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:31,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,943 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:31,943 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:31,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,945 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 10:23:31,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,947 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:23:31,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:23:31,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,951 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:31,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:23:31,952 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:23:31,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,959 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:23:31,960 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:23:31,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:31,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,962 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:23:31,962 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:23:31,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,965 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 10:23:31,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:31,966 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:23:31,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,966 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:23:31,967 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:23:31,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:31,974 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:23:31,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,975 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:31,975 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:23:31,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:31,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,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-18 10:23:31,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:31,983 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:23:31,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,983 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:23:31,984 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:23:31,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:31,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:31,987 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:23:31,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:23:31,988 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:23:31,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:31,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:31,991 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 10:23:31,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-18 10:23:31,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:31,992 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:23:31,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:31,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:31,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:31,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:31,994 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:31,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,004 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:23:32,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,005 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:32,005 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:32,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:23:32,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,015 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:23:32,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,016 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:32,017 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:32,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,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-18 10:23:32,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,021 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:23:32,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,021 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:32,022 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:32,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,026 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 10:23:32,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,027 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,027 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:23:32,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,028 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:23:32,030 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:23:32,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,048 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:23:32,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,049 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:32,049 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:23:32,051 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:23:32,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,065 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:23:32,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,065 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:23:32,067 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:23:32,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,069 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:23:32,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,070 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:23:32,071 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:23:32,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,077 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 10:23:32,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,078 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,078 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:23:32,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:32,080 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:32,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,084 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,084 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:23:32,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,084 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:32,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:32,085 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:23:32,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,092 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:23:32,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,092 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:32,093 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:32,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,096 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:23:32,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,104 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:23:32,105 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:23:32,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,107 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 10:23:32,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,108 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:23:32,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,108 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:23:32,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:32,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,116 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:23:32,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,116 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:32,116 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:23:32,117 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 10:23:32,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,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-18 10:23:32,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,132 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:23:32,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,133 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:23:32,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:32,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:32,146 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:23:32,146 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:23:32,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:32,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:32,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:32,146 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:23:32,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:32,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:32,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:32,391 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-11-18 10:23:32,477 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:32,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:32,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:32,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:32,477 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:23:32,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:32,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:32,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:32,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Lasso [2018-11-18 10:23:32,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:32,477 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:32,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:32,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:32,487 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-18 10:23:32,492 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-18 10:23:32,497 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-18 10:23:32,505 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-18 10:23:32,507 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-18 10:23:32,517 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-18 10:23:32,520 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-18 10:23:32,522 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-18 10:23:32,529 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-18 10:23:32,535 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-18 10:23:32,537 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-18 10:23:32,544 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-18 10:23:32,547 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-18 10:23:32,549 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-18 10:23:32,551 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-18 10:23:32,553 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-18 10:23:32,556 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-18 10:23:32,560 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-18 10:23:32,562 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-18 10:23:32,564 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-18 10:23:32,566 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-18 10:23:32,568 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-18 10:23:32,570 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-18 10:23:32,574 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-18 10:23:32,577 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-18 10:23:32,579 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-18 10:23:32,582 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-18 10:23:32,586 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-18 10:23:32,588 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-18 10:23:32,592 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-18 10:23:32,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:32,768 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:32,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,784 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_st~0=0} Honda state: {~c_dr_st~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:32,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,802 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,805 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,805 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~__retres1~3=0} Honda state: {ULTIMATE.start_main_~__retres1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:32,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,825 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,825 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp~1=0, ULTIMATE.start_is_do_write_p_triggered_#res=0} Honda state: {ULTIMATE.start_activate_threads_~tmp~1=0, ULTIMATE.start_is_do_write_p_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:32,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,843 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,846 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,846 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=0} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:32,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,875 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,875 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:32,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,905 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,905 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~tmp~4=0} Honda state: {ULTIMATE.start_start_simulation_~tmp~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/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-18 10:23:32,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,924 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,924 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_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:32,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,941 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,943 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,943 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret3=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:32,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,964 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,964 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a_t~0=0} Honda state: {~a_t~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:32,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:32,982 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:32,984 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:32,984 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=0} Honda state: {ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,004 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,004 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=0, ULTIMATE.start_exists_runnable_thread_#res=0, ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_exists_runnable_thread_#res=1, ULTIMATE.start_eval_~tmp___1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,029 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,031 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,031 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret5=0} Honda state: {ULTIMATE.start_eval_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,050 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,050 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Honda state: {~p_last_write~0=0, ~q_buf_0~0=0, ULTIMATE.start_do_write_p_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,067 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,067 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_pc~0=0} Honda state: {~c_dr_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,085 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,087 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,087 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6=0} Honda state: {ULTIMATE.start_eval_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,105 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_i~0=0} Honda state: {~c_dr_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,124 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,126 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,126 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_st~0=0} Honda state: {~p_dw_st~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,147 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,147 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_pc~0=0} Honda state: {~p_dw_pc~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,163 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:23:33,186 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,204 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,204 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_num_write~0=0} Honda state: {~p_num_write~0=0} Generalized eigenvectors: [{~p_num_write~0=-2}, {~p_num_write~0=2}, {~p_num_write~0=1}] Lambdas: [2, 1, 1] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,223 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,223 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_last_read~0=0} Honda state: {~c_last_read~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,240 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,240 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p_dw_i~0=0} Honda state: {~p_dw_i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,256 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,258 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,259 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,274 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,274 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,276 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,276 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret4=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,292 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,297 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:23:33,297 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~2=0} Honda state: {ULTIMATE.start_eval_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:23:33,322 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:23:33,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:23:33,356 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:23:33,357 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:23:33,357 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:23:33,357 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:23:33,357 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:23:33,357 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:23:33,357 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:23:33,357 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:23:33,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:23:33,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_false-unreach-call_false-termination.cil.c_Iteration12_Lasso [2018-11-18 10:23:33,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:23:33,358 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:23:33,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:33,361 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-18 10:23:33,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:33,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:23:33,364 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-18 10:23:33,371 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-18 10:23:33,373 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-18 10:23:33,376 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-18 10:23:33,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-18 10:23:33,383 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-18 10:23:33,385 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-18 10:23:33,386 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-18 10:23:33,387 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-18 10:23:33,389 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-18 10:23:33,390 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-18 10:23:33,392 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-18 10:23:33,393 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-18 10:23:33,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-18 10:23:33,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-18 10:23:33,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-18 10:23:33,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-18 10:23:33,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-18 10:23:33,403 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-18 10:23:33,405 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-18 10:23:33,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-18 10:23:33,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-18 10:23:33,412 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-18 10:23:33,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-18 10:23:33,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-18 10:23:33,416 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-18 10:23:33,418 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-18 10:23:33,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-18 10:23:33,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:23:33,566 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:23:33,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:33,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:33,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:33,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:33,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:33,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:33,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:33,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:33,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:33,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:33,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:33,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:33,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:33,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:33,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:33,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:33,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:33,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:33,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:33,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:33,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:33,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,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-18 10:23:33,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:23:33,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:23:33,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:33,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:33,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:33,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:23:33,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:23:33,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:23:33,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:23:33,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:23:33,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:23:33,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-18 10:23:33,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:23:33,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:23:33,624 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:23:33,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:23:33,625 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 10:23:33,625 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 10:23:33,636 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:23:33,644 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:23:33,644 INFO L444 ModelExtractionUtils]: 5 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:23:33,644 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:23:33,646 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-18 10:23:33,646 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:23:33,646 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2018-11-18 10:23:33,677 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 10:23:33,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:33,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:33,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:23:33,819 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-18 10:23:33,820 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 10:23:33,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1272 states and 1546 transitions. cyclomatic complexity: 280 Second operand 5 states. [2018-11-18 10:23:33,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1272 states and 1546 transitions. cyclomatic complexity: 280. Second operand 5 states. Result 8652 states and 10594 transitions. Complement of second has 9 states. [2018-11-18 10:23:33,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:23:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:23:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2018-11-18 10:23:33,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 517 transitions. Stem has 39 letters. Loop has 4 letters. [2018-11-18 10:23:33,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:33,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 517 transitions. Stem has 43 letters. Loop has 4 letters. [2018-11-18 10:23:33,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:33,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 517 transitions. Stem has 39 letters. Loop has 8 letters. [2018-11-18 10:23:33,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:23:33,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8652 states and 10594 transitions. [2018-11-18 10:23:33,997 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 2802 [2018-11-18 10:23:34,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8652 states to 6612 states and 8095 transitions. [2018-11-18 10:23:34,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2954 [2018-11-18 10:23:34,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2968 [2018-11-18 10:23:34,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6612 states and 8095 transitions. [2018-11-18 10:23:34,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:34,028 INFO L705 BuchiCegarLoop]: Abstraction has 6612 states and 8095 transitions. [2018-11-18 10:23:34,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states and 8095 transitions. [2018-11-18 10:23:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 6260. [2018-11-18 10:23:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6260 states. [2018-11-18 10:23:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 7695 transitions. [2018-11-18 10:23:34,121 INFO L728 BuchiCegarLoop]: Abstraction has 6260 states and 7695 transitions. [2018-11-18 10:23:34,121 INFO L608 BuchiCegarLoop]: Abstraction has 6260 states and 7695 transitions. [2018-11-18 10:23:34,121 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 10:23:34,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6260 states and 7695 transitions. [2018-11-18 10:23:34,138 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 2587 [2018-11-18 10:23:34,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:34,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:34,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:34,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:34,139 INFO L794 eck$LassoCheckResult]: Stem: 28186#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 28022#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 28023#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 28111#L212 assume !(1 == ~q_req_up~0); 28151#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 28250#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 28249#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 28082#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 28083#L265 assume !(0 == ~q_read_ev~0); 28084#L265-2 assume !(0 == ~q_write_ev~0); 28085#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 28169#L55 assume !(1 == ~p_dw_pc~0); 28181#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 28182#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 28106#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 28107#L305 assume !(0 != activate_threads_~tmp~1); 28224#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 28213#L74 assume !(1 == ~c_dr_pc~0); 28179#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 28180#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 28131#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 28132#L313 assume !(0 != activate_threads_~tmp___0~1); 28229#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 28196#L283 assume !(1 == ~q_read_ev~0); 28197#L283-2 assume !(1 == ~q_write_ev~0); 28024#L288-1 assume { :end_inline_reset_delta_events } true; 28025#L409-3 assume true; 28283#L409-1 assume !false; 28282#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 28281#L354 assume true; 28280#L329-1 assume !false; 28279#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 28278#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 28277#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 28276#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 28275#L334 assume 0 != eval_~tmp___1~0; 28274#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 28273#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 28271#L118 assume 0 == ~p_dw_pc~0; 28272#L129-2 assume true; 29060#L129 [2018-11-18 10:23:34,139 INFO L796 eck$LassoCheckResult]: Loop: 29060#L129 assume !false; 31728#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 32023#L148 assume { :end_inline_do_write_p } true; 31784#L339 assume !(0 == ~c_dr_st~0); 31781#L354 assume true; 32007#L329-1 assume !false; 32006#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 32005#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 31748#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 31744#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 31743#L334 assume 0 != eval_~tmp___1~0; 31739#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 31740#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 31733#L118 assume !(0 == ~p_dw_pc~0); 31734#L121 assume 1 == ~p_dw_pc~0; 31729#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; 31730#L129-2 assume true; 29060#L129 [2018-11-18 10:23:34,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:34,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1282294005, now seen corresponding path program 1 times [2018-11-18 10:23:34,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:34,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:34,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:34,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:34,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1693091944, now seen corresponding path program 1 times [2018-11-18 10:23:34,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:34,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:34,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:34,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:34,202 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-18 10:23:34,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:34,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:34,202 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:34,202 INFO L87 Difference]: Start difference. First operand 6260 states and 7695 transitions. cyclomatic complexity: 1468 Second operand 3 states. [2018-11-18 10:23:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:34,271 INFO L93 Difference]: Finished difference Result 6260 states and 7509 transitions. [2018-11-18 10:23:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:34,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6260 states and 7509 transitions. [2018-11-18 10:23:34,291 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 2361 [2018-11-18 10:23:34,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6260 states to 6260 states and 7509 transitions. [2018-11-18 10:23:34,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2722 [2018-11-18 10:23:34,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2722 [2018-11-18 10:23:34,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6260 states and 7509 transitions. [2018-11-18 10:23:34,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:34,316 INFO L705 BuchiCegarLoop]: Abstraction has 6260 states and 7509 transitions. [2018-11-18 10:23:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states and 7509 transitions. [2018-11-18 10:23:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 6260. [2018-11-18 10:23:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6260 states. [2018-11-18 10:23:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 7509 transitions. [2018-11-18 10:23:34,387 INFO L728 BuchiCegarLoop]: Abstraction has 6260 states and 7509 transitions. [2018-11-18 10:23:34,387 INFO L608 BuchiCegarLoop]: Abstraction has 6260 states and 7509 transitions. [2018-11-18 10:23:34,387 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 10:23:34,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6260 states and 7509 transitions. [2018-11-18 10:23:34,401 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 2361 [2018-11-18 10:23:34,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:34,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:34,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:34,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:34,402 INFO L794 eck$LassoCheckResult]: Stem: 40711#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 40548#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 40549#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 40633#L212 assume !(1 == ~q_req_up~0); 40671#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 40758#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 40757#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 40607#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 40608#L265 assume !(0 == ~q_read_ev~0); 40609#L265-2 assume !(0 == ~q_write_ev~0); 40610#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 40688#L55 assume !(1 == ~p_dw_pc~0); 40706#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 40707#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 40629#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 40630#L305 assume !(0 != activate_threads_~tmp~1); 40741#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 40732#L74 assume !(1 == ~c_dr_pc~0); 40703#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 40704#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 40650#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 40651#L313 assume !(0 != activate_threads_~tmp___0~1); 40747#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 40718#L283 assume !(1 == ~q_read_ev~0); 40719#L283-2 assume !(1 == ~q_write_ev~0); 40550#L288-1 assume { :end_inline_reset_delta_events } true; 40551#L409-3 assume true; 40803#L409-1 assume !false; 41785#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 41782#L354 assume true; 41779#L329-1 assume !false; 41776#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 41773#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 41772#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 41770#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 41767#L334 assume 0 != eval_~tmp___1~0; 41764#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 41761#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 41757#L118 assume 0 == ~p_dw_pc~0; 41753#L129-2 assume true; 41754#L129 assume !false; 42340#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 45693#L148 assume { :end_inline_do_write_p } true; 45687#L339 [2018-11-18 10:23:34,402 INFO L796 eck$LassoCheckResult]: Loop: 45687#L339 assume !(0 == ~c_dr_st~0); 45682#L354 assume true; 46226#L329-1 assume !false; 46225#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 46224#L245 assume !(0 == ~p_dw_st~0); 46222#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 46218#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 46219#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 45751#L334 assume 0 != eval_~tmp___1~0; 45692#L334-1 assume !(0 == ~p_dw_st~0); 45687#L339 [2018-11-18 10:23:34,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:34,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1381757167, now seen corresponding path program 1 times [2018-11-18 10:23:34,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:34,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:34,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:34,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:34,419 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-18 10:23:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:34,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:34,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:34,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:34,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1417818988, now seen corresponding path program 1 times [2018-11-18 10:23:34,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:34,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:34,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:34,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:34,429 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-18 10:23:34,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:34,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:23:34,429 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:34,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:34,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:34,430 INFO L87 Difference]: Start difference. First operand 6260 states and 7509 transitions. cyclomatic complexity: 1294 Second operand 3 states. [2018-11-18 10:23:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:34,476 INFO L93 Difference]: Finished difference Result 7878 states and 9175 transitions. [2018-11-18 10:23:34,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:34,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7878 states and 9175 transitions. [2018-11-18 10:23:34,499 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 2880 [2018-11-18 10:23:34,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7878 states to 7878 states and 9175 transitions. [2018-11-18 10:23:34,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3427 [2018-11-18 10:23:34,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3427 [2018-11-18 10:23:34,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7878 states and 9175 transitions. [2018-11-18 10:23:34,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:34,528 INFO L705 BuchiCegarLoop]: Abstraction has 7878 states and 9175 transitions. [2018-11-18 10:23:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states and 9175 transitions. [2018-11-18 10:23:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7878. [2018-11-18 10:23:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7878 states. [2018-11-18 10:23:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 9175 transitions. [2018-11-18 10:23:34,603 INFO L728 BuchiCegarLoop]: Abstraction has 7878 states and 9175 transitions. [2018-11-18 10:23:34,603 INFO L608 BuchiCegarLoop]: Abstraction has 7878 states and 9175 transitions. [2018-11-18 10:23:34,603 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 10:23:34,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7878 states and 9175 transitions. [2018-11-18 10:23:34,619 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 2880 [2018-11-18 10:23:34,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:34,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:34,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:34,620 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:34,620 INFO L794 eck$LassoCheckResult]: Stem: 54868#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 54693#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 54694#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 54779#L212 assume !(1 == ~q_req_up~0); 54825#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 54937#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 54936#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 54752#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 54753#L265 assume !(0 == ~q_read_ev~0); 54754#L265-2 assume !(0 == ~q_write_ev~0); 54755#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 54846#L55 assume !(1 == ~p_dw_pc~0); 54866#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 54867#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 54774#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 54775#L305 assume !(0 != activate_threads_~tmp~1); 54916#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 54899#L74 assume !(1 == ~c_dr_pc~0); 54859#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 54860#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 54795#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 54796#L313 assume !(0 != activate_threads_~tmp___0~1); 54919#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 54881#L283 assume !(1 == ~q_read_ev~0); 54882#L283-2 assume !(1 == ~q_write_ev~0); 54695#L288-1 assume { :end_inline_reset_delta_events } true; 54696#L409-3 assume true; 54985#L409-1 assume !false; 54984#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 54983#L354 assume true; 54982#L329-1 assume !false; 54981#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 54980#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 54979#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 54978#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 54977#L334 assume 0 != eval_~tmp___1~0; 54975#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 54973#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 54970#L118 assume 0 == ~p_dw_pc~0; 54966#L129-2 assume true; 54962#L129 assume !false; 54953#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 54954#L148 assume { :end_inline_do_write_p } true; 54945#L339 [2018-11-18 10:23:34,620 INFO L796 eck$LassoCheckResult]: Loop: 54945#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 54947#L358 assume !(0 != eval_~tmp___0~2); 60939#L354 assume true; 61035#L329-1 assume !false; 54988#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 54987#L245 assume !(0 == ~p_dw_st~0); 54967#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 54958#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 54955#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 54951#L334 assume 0 != eval_~tmp___1~0; 54952#L334-1 assume !(0 == ~p_dw_st~0); 54945#L339 [2018-11-18 10:23:34,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1381757167, now seen corresponding path program 2 times [2018-11-18 10:23:34,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:34,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:34,643 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-18 10:23:34,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:34,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:34,643 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:34,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:34,643 INFO L82 PathProgramCache]: Analyzing trace with hash -860123838, now seen corresponding path program 1 times [2018-11-18 10:23:34,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:34,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:34,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:34,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:34,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:34,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:34,678 INFO L87 Difference]: Start difference. First operand 7878 states and 9175 transitions. cyclomatic complexity: 1366 Second operand 3 states. [2018-11-18 10:23:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:34,715 INFO L93 Difference]: Finished difference Result 10752 states and 12505 transitions. [2018-11-18 10:23:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:34,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10752 states and 12505 transitions. [2018-11-18 10:23:34,739 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 3872 [2018-11-18 10:23:34,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10752 states to 10748 states and 12501 transitions. [2018-11-18 10:23:34,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4708 [2018-11-18 10:23:34,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4708 [2018-11-18 10:23:34,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10748 states and 12501 transitions. [2018-11-18 10:23:34,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:34,768 INFO L705 BuchiCegarLoop]: Abstraction has 10748 states and 12501 transitions. [2018-11-18 10:23:34,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10748 states and 12501 transitions. [2018-11-18 10:23:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10748 to 7525. [2018-11-18 10:23:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7525 states. [2018-11-18 10:23:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 8768 transitions. [2018-11-18 10:23:34,853 INFO L728 BuchiCegarLoop]: Abstraction has 7525 states and 8768 transitions. [2018-11-18 10:23:34,853 INFO L608 BuchiCegarLoop]: Abstraction has 7525 states and 8768 transitions. [2018-11-18 10:23:34,853 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 10:23:34,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7525 states and 8768 transitions. [2018-11-18 10:23:34,867 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 2380 [2018-11-18 10:23:34,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:34,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:34,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:34,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:23:34,868 INFO L794 eck$LassoCheckResult]: Stem: 73500#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 73330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 73331#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 73415#L212 assume !(1 == ~q_req_up~0); 73460#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 73563#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 73562#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 73387#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 73388#L265 assume !(0 == ~q_read_ev~0); 73389#L265-2 assume !(0 == ~q_write_ev~0); 73390#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 73479#L55 assume !(1 == ~p_dw_pc~0); 73498#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 73499#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 73409#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 73410#L305 assume !(0 != activate_threads_~tmp~1); 73541#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 73529#L74 assume !(1 == ~c_dr_pc~0); 73491#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 73492#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 73431#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 73432#L313 assume !(0 != activate_threads_~tmp___0~1); 73543#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 73513#L283 assume !(1 == ~q_read_ev~0); 73514#L283-2 assume !(1 == ~q_write_ev~0); 73332#L288-1 assume { :end_inline_reset_delta_events } true; 73333#L409-3 assume true; 73614#L409-1 assume !false; 73613#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 73612#L354 assume true; 73611#L329-1 assume !false; 73610#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 73609#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 73608#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 73607#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 73606#L334 assume 0 != eval_~tmp___1~0; 73605#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 73604#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 73602#L118 assume !(0 == ~p_dw_pc~0); 73601#L121 assume !(1 == ~p_dw_pc~0); 73600#L129-2 assume true; 73599#L129 assume !false; 73598#L130 assume !(0 == ~q_free~0); 73593#L131 [2018-11-18 10:23:34,868 INFO L796 eck$LassoCheckResult]: Loop: 73593#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; 73591#L129-2 assume true; 73584#L129 assume !false; 73585#L130 assume !(0 == ~q_free~0); 73593#L131 [2018-11-18 10:23:34,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:34,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1383479148, now seen corresponding path program 1 times [2018-11-18 10:23:34,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:34,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:34,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:34,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:34,887 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-18 10:23:34,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:34,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:23:34,887 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:23:34,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:34,888 INFO L82 PathProgramCache]: Analyzing trace with hash 6911705, now seen corresponding path program 2 times [2018-11-18 10:23:34,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:34,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:34,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:34,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:23:34,902 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-18 10:23:34,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:23:34,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-18 10:23:34,902 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:23:34,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:23:34,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:23:34,903 INFO L87 Difference]: Start difference. First operand 7525 states and 8768 transitions. cyclomatic complexity: 1309 Second operand 3 states. [2018-11-18 10:23:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:23:34,954 INFO L93 Difference]: Finished difference Result 2865 states and 3258 transitions. [2018-11-18 10:23:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:23:34,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2865 states and 3258 transitions. [2018-11-18 10:23:34,962 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1100 [2018-11-18 10:23:34,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2865 states to 2509 states and 2862 transitions. [2018-11-18 10:23:34,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1508 [2018-11-18 10:23:34,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1512 [2018-11-18 10:23:34,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2509 states and 2862 transitions. [2018-11-18 10:23:34,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:23:34,970 INFO L705 BuchiCegarLoop]: Abstraction has 2509 states and 2862 transitions. [2018-11-18 10:23:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states and 2862 transitions. [2018-11-18 10:23:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1788. [2018-11-18 10:23:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2018-11-18 10:23:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2072 transitions. [2018-11-18 10:23:34,986 INFO L728 BuchiCegarLoop]: Abstraction has 1788 states and 2072 transitions. [2018-11-18 10:23:34,986 INFO L608 BuchiCegarLoop]: Abstraction has 1788 states and 2072 transitions. [2018-11-18 10:23:34,986 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 10:23:34,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1788 states and 2072 transitions. [2018-11-18 10:23:34,989 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 867 [2018-11-18 10:23:34,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:23:34,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:23:34,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-11-18 10:23:34,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:23:34,990 INFO L794 eck$LassoCheckResult]: Stem: 83887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 83725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 83726#L452 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~4;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 83805#L212 assume !(1 == ~q_req_up~0); 83851#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 83935#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 83934#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 83777#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 83778#L265 assume !(0 == ~q_read_ev~0); 83779#L265-2 assume !(0 == ~q_write_ev~0); 83780#L270-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 83866#L55 assume !(1 == ~p_dw_pc~0); 83885#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 83886#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 83800#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;assume { :end_inline_is_do_write_p_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 83801#L305 assume !(0 != activate_threads_~tmp~1); 83919#L305-2 assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 83910#L74 assume !(1 == ~c_dr_pc~0); 83876#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 83877#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 83822#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;assume { :end_inline_is_do_read_c_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 83823#L313 assume !(0 != activate_threads_~tmp___0~1); 83922#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 83896#L283 assume !(1 == ~q_read_ev~0); 83897#L283-2 assume !(1 == ~q_write_ev~0); 83727#L288-1 assume { :end_inline_reset_delta_events } true; 83728#L409-3 assume true; 84495#L409-1 assume !false; 85430#L410 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5, eval_#t~nondet6, eval_#t~nondet7, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 85429#L354 assume true; 85428#L329-1 assume !false; 85427#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 85426#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 85425#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 85424#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 85423#L334 assume 0 != eval_~tmp___1~0; 85422#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 85421#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 85420#L118 assume 0 == ~p_dw_pc~0; 85418#L129-2 assume true; 85416#L129 assume !false; 85414#L130 assume !(0 == ~q_free~0); 85412#L131 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; 85410#L129-2 assume true; 85408#L129 assume !false; 85406#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 84539#L148 assume { :end_inline_do_write_p } true; 84537#L339 [2018-11-18 10:23:34,990 INFO L796 eck$LassoCheckResult]: Loop: 84537#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 83860#L358 assume !(0 != eval_~tmp___0~2); 83861#L354 assume true; 85417#L329-1 assume !false; 85415#L330 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 85413#L245 assume !(0 == ~p_dw_st~0); 85411#L249 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 85409#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 85407#L258 eval_#t~ret5 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 85405#L334 assume 0 != eval_~tmp___1~0; 84538#L334-1 assume !(0 == ~p_dw_st~0); 84537#L339 [2018-11-18 10:23:34,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:34,991 INFO L82 PathProgramCache]: Analyzing trace with hash -180839785, now seen corresponding path program 1 times [2018-11-18 10:23:34,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:34,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:35,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:35,001 INFO L82 PathProgramCache]: Analyzing trace with hash -860123838, now seen corresponding path program 2 times [2018-11-18 10:23:35,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:35,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:35,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:35,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:23:35,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:35,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:23:35,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1142266092, now seen corresponding path program 1 times [2018-11-18 10:23:35,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:23:35,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:23:35,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:35,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:23:35,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:23:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:23:35,227 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2018-11-18 10:23:35,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:23:35 BoogieIcfgContainer [2018-11-18 10:23:35,276 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:23:35,277 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:23:35,278 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:23:35,278 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:23:35,278 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:23:28" (3/4) ... [2018-11-18 10:23:35,280 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 10:23:35,317 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_212dc7ff-3fbd-4069-b4b5-0df565be15aa/bin-2019/uautomizer/witness.graphml [2018-11-18 10:23:35,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:23:35,318 INFO L168 Benchmark]: Toolchain (without parser) took 7072.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 958.2 MB in the beginning and 909.8 MB in the end (delta: 48.4 MB). Peak memory consumption was 383.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,319 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:23:35,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.09 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 942.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,319 INFO L168 Benchmark]: Boogie Preprocessor took 22.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,320 INFO L168 Benchmark]: RCFGBuilder took 366.22 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: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,320 INFO L168 Benchmark]: BuchiAutomizer took 6380.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 909.8 MB in the end (delta: 199.3 MB). Peak memory consumption was 387.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:23:35,320 INFO L168 Benchmark]: Witness Printer took 40.21 ms. Allocated memory is still 1.4 GB. Free memory is still 909.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:23:35,322 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.09 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 942.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 366.22 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: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6380.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 909.8 MB in the end (delta: 199.3 MB). Peak memory consumption was 387.0 MB. Max. memory is 11.5 GB. * Witness Printer took 40.21 ms. Allocated memory is still 1.4 GB. Free memory is still 909.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * q_read_ev + 1 and consists of 3 locations. One deterministic module has affine ranking function q_free and consists of 6 locations. 15 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 1788 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 17 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. Construction of modules took 0.4s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 5254 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 7878 states and ocurred in iteration 14. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2706 SDtfs, 2569 SDslu, 3133 SDs, 0 SdLazy, 336 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc0 concLT1 SILN1 SILU0 SILI7 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp21 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq204 hnf89 smp100 dnf151 smp87 tf105 neg92 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 27 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 354]: 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 {p_last_write=4, c_dr_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@649a62cf=0, c_dr_pc=0, a_t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e56044e=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@755dc9da=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___1=1, q_req_up=1, tmp___0=0, q_write_ev=2, __retres1=1, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2021a0b=0, q_free=0, __retres1=0, p_dw_st=2, \result=0, q_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@316ad7cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e54da09=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c055def=0, c_last_read=0, tmp___0=0, __retres1=0, tmp=0, p_num_write=1, q_buf_0=4, __retres1=0, \result=1, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 329]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; [L456] int __retres1 ; [L460] CALL init_model() [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] RET c_dr_i = 1 [L460] init_model() [L461] CALL start_simulation() [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L402] CALL update_channels() [L212] COND FALSE, RET !((int )q_req_up == 1) [L402] update_channels() [L403] CALL init_threads() [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] RET c_dr_st = 0 [L403] init_threads() [L404] CALL fire_delta_events() [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE, RET !((int )q_write_ev == 0) [L404] fire_delta_events() [L405] CALL activate_threads() [L298] int tmp ; [L299] int tmp___0 ; [L303] CALL, EXPR is_do_write_p_triggered() [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] RET return (__retres1); [L303] EXPR is_do_write_p_triggered() [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L311] CALL, EXPR is_do_read_c_triggered() [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] RET return (__retres1); [L311] EXPR is_do_read_c_triggered() [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE, RET !(\read(tmp___0)) [L405] activate_threads() [L406] CALL reset_delta_events() [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE, RET !((int )q_write_ev == 1) [L406] reset_delta_events() [L409] COND TRUE 1 [L412] kernel_st = 1 [L413] CALL eval() [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; [L329] COND TRUE 1 [L332] CALL, EXPR exists_runnable_thread() [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] RET return (__retres1); [L332] EXPR exists_runnable_thread() [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp) [L345] p_dw_st = 1 [L346] CALL do_write_p() [L118] COND TRUE (int )p_dw_pc == 0 [L129] COND TRUE 1 [L131] COND FALSE !((int )q_free == 0) [L141] q_buf_0 = __VERIFIER_nondet_int() [L142] p_last_write = q_buf_0 [L143] p_num_write += 1 [L144] q_free = 0 [L145] q_req_up = 1 [L129] COND TRUE 1 [L131] COND TRUE (int )q_free == 0 [L132] p_dw_st = 2 [L133] RET p_dw_pc = 1 [L346] do_write_p() Loop: [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) [L329] COND TRUE 1 [L332] CALL, EXPR exists_runnable_thread() [L242] int __retres1 ; [L245] COND FALSE !((int )p_dw_st == 0) [L249] COND TRUE (int )c_dr_st == 0 [L250] __retres1 = 1 [L258] RET return (__retres1); [L332] EXPR exists_runnable_thread() [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) [L339] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...