./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-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_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/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 d321e3b1b642bcfc9c94c4888bd187898cb1af58 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:14:05,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:14:05,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:14:05,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:14:05,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:14:05,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:14:05,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:14:05,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:14:05,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:14:05,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:14:05,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:14:05,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:14:05,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:14:05,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:14:05,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:14:05,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:14:05,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:14:05,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:14:05,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:14:05,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:14:05,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:14:05,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:14:05,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:14:05,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:14:05,413 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:14:05,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:14:05,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:14:05,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:14:05,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:14:05,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:14:05,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:14:05,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:14:05,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:14:05,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:14:05,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:14:05,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:14:05,418 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:14:05,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:14:05,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:14:05,430 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:14:05,430 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:14:05,430 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:14:05,430 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:14:05,430 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:14:05,431 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:14:05,431 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:14:05,431 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:14:05,431 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:14:05,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:14:05,431 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:14:05,431 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:14:05,432 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:14:05,432 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:14:05,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:14:05,432 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:14:05,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:14:05,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:14:05,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:14:05,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:14:05,432 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:14:05,433 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:14:05,433 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:14:05,433 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:14:05,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:14:05,433 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:14:05,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:14:05,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:14:05,434 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:14:05,434 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:14:05,434 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_4102cdbf-369d-438c-95ec-0c113161b23e/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 -> d321e3b1b642bcfc9c94c4888bd187898cb1af58 [2018-11-18 13:14:05,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:14:05,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:14:05,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:14:05,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:14:05,469 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:14:05,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-18 13:14:05,515 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/data/00bb5b45d/a14d175ceaf94c5ba803eb9449ddb08a/FLAG998ebcf47 [2018-11-18 13:14:05,857 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:14:05,857 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/sv-benchmarks/c/systemc/pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-18 13:14:05,865 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/data/00bb5b45d/a14d175ceaf94c5ba803eb9449ddb08a/FLAG998ebcf47 [2018-11-18 13:14:06,274 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/data/00bb5b45d/a14d175ceaf94c5ba803eb9449ddb08a [2018-11-18 13:14:06,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:14:06,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:14:06,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:14:06,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:14:06,280 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:14:06,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b1aab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06, skipping insertion in model container [2018-11-18 13:14:06,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:14:06,310 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:14:06,440 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:14:06,443 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:14:06,469 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:14:06,481 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:14:06,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06 WrapperNode [2018-11-18 13:14:06,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:14:06,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:14:06,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:14:06,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:14:06,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:14:06,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:14:06,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:14:06,510 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:14:06,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... [2018-11-18 13:14:06,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:14:06,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:14:06,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:14:06,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:14:06,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/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 13:14:06,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:14:06,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:14:06,922 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:14:06,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:14:06 BoogieIcfgContainer [2018-11-18 13:14:06,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:14:06,923 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:14:06,923 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:14:06,925 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:14:06,926 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:14:06,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:14:06" (1/3) ... [2018-11-18 13:14:06,926 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f996a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:14:06, skipping insertion in model container [2018-11-18 13:14:06,927 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:14:06,927 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:14:06" (2/3) ... [2018-11-18 13:14:06,927 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f996a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:14:06, skipping insertion in model container [2018-11-18 13:14:06,927 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:14:06,927 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:14:06" (3/3) ... [2018-11-18 13:14:06,928 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_2_true-unreach-call_false-termination.cil.c [2018-11-18 13:14:06,961 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:14:06,962 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:14:06,962 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:14:06,962 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:14:06,962 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:14:06,962 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:14:06,962 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:14:06,962 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:14:06,962 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:14:06,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2018-11-18 13:14:06,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2018-11-18 13:14:06,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:06,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:06,994 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 13:14:06,994 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 13:14:06,994 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:14:06,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2018-11-18 13:14:06,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2018-11-18 13:14:06,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:06,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:07,000 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 13:14:07,000 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 13:14:07,005 INFO L794 eck$LassoCheckResult]: Stem: 72#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; 50#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); 59#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; 75#L55true assume !(1 == ~p_dw_pc~0); 70#L55-2true is_do_write_p_triggered_~__retres1~0 := 0; 76#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; 94#L305true assume !(0 != activate_threads_~tmp~1); 98#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; 89#L74true assume 1 == ~c_dr_pc~0; 42#L75true assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 90#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; 99#L313true assume !(0 != activate_threads_~tmp___0~1); 100#L313-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 82#L283true assume !(1 == ~q_read_ev~0); 97#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 13:14:07,005 INFO L796 eck$LassoCheckResult]: Loop: 6#L409-3true assume true; 3#L409-1true assume !false; 78#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; 53#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; 51#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; 74#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; 81#L305-3true assume !(0 != activate_threads_~tmp~1); 84#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; 65#L74-3true assume 1 == ~c_dr_pc~0; 39#L75-1true assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 68#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; 102#L313-3true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 88#L313-5true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 96#L283-3true assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 92#L283-5true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 103#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; 52#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; 108#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; 56#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; 105#L426true assume !(0 != start_simulation_~tmp~4); 6#L409-3true [2018-11-18 13:14:07,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,010 INFO L82 PathProgramCache]: Analyzing trace with hash -239976594, now seen corresponding path program 1 times [2018-11-18 13:14:07,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,100 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 13:14:07,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:14:07,106 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:14:07,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash -965560389, now seen corresponding path program 1 times [2018-11-18 13:14:07,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,115 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 13:14:07,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:14:07,117 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:07,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:07,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:07,128 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2018-11-18 13:14:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:07,143 INFO L93 Difference]: Finished difference Result 105 states and 148 transitions. [2018-11-18 13:14:07,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:07,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 148 transitions. [2018-11-18 13:14:07,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-18 13:14:07,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 99 states and 142 transitions. [2018-11-18 13:14:07,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2018-11-18 13:14:07,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2018-11-18 13:14:07,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 142 transitions. [2018-11-18 13:14:07,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:14:07,153 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 142 transitions. [2018-11-18 13:14:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 142 transitions. [2018-11-18 13:14:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-18 13:14:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 13:14:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2018-11-18 13:14:07,176 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 142 transitions. [2018-11-18 13:14:07,176 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 142 transitions. [2018-11-18 13:14:07,176 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:14:07,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 142 transitions. [2018-11-18 13:14:07,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-18 13:14:07,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:07,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:07,179 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 13:14:07,179 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 13:14:07,179 INFO L794 eck$LassoCheckResult]: Stem: 306#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; 229#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; 230#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; 274#L212 assume !(1 == ~q_req_up~0); 293#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 247#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 241#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 242#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 257#L265 assume !(0 == ~q_read_ev~0); 258#L265-2 assume !(0 == ~q_write_ev~0); 259#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; 300#L55 assume !(1 == ~p_dw_pc~0); 270#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 269#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 271#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; 272#L305 assume !(0 != activate_threads_~tmp~1); 317#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; 314#L74 assume 1 == ~c_dr_pc~0; 283#L75 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 284#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 286#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; 287#L313 assume !(0 != activate_threads_~tmp___0~1); 319#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 309#L283 assume !(1 == ~q_read_ev~0); 310#L283-2 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 231#L288-1 assume { :end_inline_reset_delta_events } true; 228#L409-3 [2018-11-18 13:14:07,179 INFO L796 eck$LassoCheckResult]: Loop: 228#L409-3 assume true; 221#L409-1 assume !false; 222#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; 223#L354 assume true; 224#L329-1 assume !false; 232#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; 305#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 249#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 262#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; 250#L334 assume !(0 != eval_~tmp___1~0); 243#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 244#L212-3 assume !(1 == ~q_req_up~0); 291#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 254#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 255#L265-5 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 273#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; 295#L55-3 assume 1 == ~p_dw_pc~0; 263#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 264#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 266#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; 267#L305-3 assume !(0 != activate_threads_~tmp~1); 308#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; 303#L74-3 assume 1 == ~c_dr_pc~0; 277#L75-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 278#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 280#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; 281#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 312#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 313#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 315#L283-5 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 316#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; 296#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 246#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 261#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; 235#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 236#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 239#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; 240#L426 assume !(0 != start_simulation_~tmp~4); 228#L409-3 [2018-11-18 13:14:07,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,180 INFO L82 PathProgramCache]: Analyzing trace with hash 577671856, now seen corresponding path program 1 times [2018-11-18 13:14:07,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,217 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 13:14:07,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:14:07,218 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:14:07,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,218 INFO L82 PathProgramCache]: Analyzing trace with hash -21428580, now seen corresponding path program 1 times [2018-11-18 13:14:07,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:14:07,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:14:07,247 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:07,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:07,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:07,247 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. cyclomatic complexity: 44 Second operand 3 states. [2018-11-18 13:14:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:07,270 INFO L93 Difference]: Finished difference Result 162 states and 229 transitions. [2018-11-18 13:14:07,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:07,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 229 transitions. [2018-11-18 13:14:07,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 129 [2018-11-18 13:14:07,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 229 transitions. [2018-11-18 13:14:07,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2018-11-18 13:14:07,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-18 13:14:07,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 229 transitions. [2018-11-18 13:14:07,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:14:07,276 INFO L705 BuchiCegarLoop]: Abstraction has 162 states and 229 transitions. [2018-11-18 13:14:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 229 transitions. [2018-11-18 13:14:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2018-11-18 13:14:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-18 13:14:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2018-11-18 13:14:07,283 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 222 transitions. [2018-11-18 13:14:07,283 INFO L608 BuchiCegarLoop]: Abstraction has 156 states and 222 transitions. [2018-11-18 13:14:07,284 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:14:07,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 222 transitions. [2018-11-18 13:14:07,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 123 [2018-11-18 13:14:07,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:07,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:07,286 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 13:14:07,286 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 13:14:07,286 INFO L794 eck$LassoCheckResult]: Stem: 580#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; 499#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; 500#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; 546#L212 assume !(1 == ~q_req_up~0); 563#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 518#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 512#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 513#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 529#L265 assume !(0 == ~q_read_ev~0); 530#L265-2 assume !(0 == ~q_write_ev~0); 531#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; 571#L55 assume !(1 == ~p_dw_pc~0); 542#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 541#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 543#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; 544#L305 assume !(0 != activate_threads_~tmp~1); 593#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; 588#L74 assume !(1 == ~c_dr_pc~0); 577#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 578#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 555#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; 556#L313 assume !(0 != activate_threads_~tmp___0~1); 595#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 583#L283 assume !(1 == ~q_read_ev~0); 584#L283-2 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 501#L288-1 assume { :end_inline_reset_delta_events } true; 502#L409-3 [2018-11-18 13:14:07,287 INFO L796 eck$LassoCheckResult]: Loop: 502#L409-3 assume true; 628#L409-1 assume !false; 627#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; 601#L354 assume true; 626#L329-1 assume !false; 624#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; 619#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 614#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 611#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; 608#L334 assume !(0 != eval_~tmp___1~0); 514#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 515#L212-3 assume !(1 == ~q_req_up~0); 561#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 526#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 527#L265-5 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 545#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; 565#L55-3 assume 1 == ~p_dw_pc~0; 535#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 536#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 538#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; 539#L305-3 assume !(0 != activate_threads_~tmp~1); 582#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; 574#L74-3 assume !(1 == ~c_dr_pc~0); 575#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 646#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 645#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; 644#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 586#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 587#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 590#L283-5 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 591#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; 566#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 517#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 533#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; 506#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 507#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 635#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; 634#L426 assume !(0 != start_simulation_~tmp~4); 502#L409-3 [2018-11-18 13:14:07,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647375, now seen corresponding path program 1 times [2018-11-18 13:14:07,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,317 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 13:14:07,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:14:07,318 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:14:07,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1155175739, now seen corresponding path program 1 times [2018-11-18 13:14:07,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:14:07,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:14:07,355 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:07,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:07,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:07,355 INFO L87 Difference]: Start difference. First operand 156 states and 222 transitions. cyclomatic complexity: 68 Second operand 3 states. [2018-11-18 13:14:07,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:07,380 INFO L93 Difference]: Finished difference Result 307 states and 430 transitions. [2018-11-18 13:14:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:07,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 430 transitions. [2018-11-18 13:14:07,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2018-11-18 13:14:07,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 307 states and 430 transitions. [2018-11-18 13:14:07,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2018-11-18 13:14:07,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2018-11-18 13:14:07,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 430 transitions. [2018-11-18 13:14:07,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:14:07,387 INFO L705 BuchiCegarLoop]: Abstraction has 307 states and 430 transitions. [2018-11-18 13:14:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 430 transitions. [2018-11-18 13:14:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-18 13:14:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-18 13:14:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 430 transitions. [2018-11-18 13:14:07,398 INFO L728 BuchiCegarLoop]: Abstraction has 307 states and 430 transitions. [2018-11-18 13:14:07,398 INFO L608 BuchiCegarLoop]: Abstraction has 307 states and 430 transitions. [2018-11-18 13:14:07,398 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:14:07,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 430 transitions. [2018-11-18 13:14:07,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2018-11-18 13:14:07,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:07,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:07,401 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 13:14:07,401 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 13:14:07,402 INFO L794 eck$LassoCheckResult]: Stem: 1062#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; 971#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; 972#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; 1021#L212 assume !(1 == ~q_req_up~0); 1043#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1260#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1259#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1258#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1257#L265 assume !(0 == ~q_read_ev~0); 1002#L265-2 assume !(0 == ~q_write_ev~0); 1003#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; 1051#L55 assume !(1 == ~p_dw_pc~0); 1063#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1249#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1248#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; 1247#L305 assume !(0 != activate_threads_~tmp~1); 1246#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; 1245#L74 assume !(1 == ~c_dr_pc~0); 1244#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 1242#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1240#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; 1238#L313 assume !(0 != activate_threads_~tmp___0~1); 1232#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1229#L283 assume !(1 == ~q_read_ev~0); 1227#L283-2 assume !(1 == ~q_write_ev~0); 1081#L288-1 assume { :end_inline_reset_delta_events } true; 1206#L409-3 [2018-11-18 13:14:07,402 INFO L796 eck$LassoCheckResult]: Loop: 1206#L409-3 assume true; 1200#L409-1 assume !false; 1199#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; 1100#L354 assume true; 1198#L329-1 assume !false; 1182#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; 1181#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1178#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1176#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; 1173#L334 assume !(0 != eval_~tmp___1~0); 1174#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 1038#L212-3 assume !(1 == ~q_req_up~0); 1040#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1202#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1019#L265-5 assume !(0 == ~q_write_ev~0); 1020#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; 1256#L55-3 assume 1 == ~p_dw_pc~0; 1254#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 1253#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1252#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; 1066#L305-3 assume !(0 != activate_threads_~tmp~1); 1067#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; 1056#L74-3 assume !(1 == ~c_dr_pc~0); 1057#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1237#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1236#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; 1235#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1234#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1231#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1224#L283-5 assume !(1 == ~q_write_ev~0); 1221#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; 1045#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 988#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1007#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; 977#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 978#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 981#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; 982#L426 assume !(0 != start_simulation_~tmp~4); 1206#L409-3 [2018-11-18 13:14:07,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 1 times [2018-11-18 13:14:07,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:07,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1701220603, now seen corresponding path program 1 times [2018-11-18 13:14:07,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,464 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 13:14:07,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:14:07,464 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:14:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:14:07,465 INFO L87 Difference]: Start difference. First operand 307 states and 430 transitions. cyclomatic complexity: 125 Second operand 5 states. [2018-11-18 13:14:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:07,564 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2018-11-18 13:14:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:14:07,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 642 transitions. [2018-11-18 13:14:07,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 406 [2018-11-18 13:14:07,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 471 states and 642 transitions. [2018-11-18 13:14:07,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 471 [2018-11-18 13:14:07,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 471 [2018-11-18 13:14:07,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 642 transitions. [2018-11-18 13:14:07,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:14:07,569 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 642 transitions. [2018-11-18 13:14:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 642 transitions. [2018-11-18 13:14:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 319. [2018-11-18 13:14:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-18 13:14:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 442 transitions. [2018-11-18 13:14:07,579 INFO L728 BuchiCegarLoop]: Abstraction has 319 states and 442 transitions. [2018-11-18 13:14:07,579 INFO L608 BuchiCegarLoop]: Abstraction has 319 states and 442 transitions. [2018-11-18 13:14:07,579 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:14:07,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 319 states and 442 transitions. [2018-11-18 13:14:07,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 258 [2018-11-18 13:14:07,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:07,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:07,582 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 13:14:07,582 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 13:14:07,582 INFO L794 eck$LassoCheckResult]: Stem: 1860#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; 1765#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; 1766#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; 1817#L212 assume !(1 == ~q_req_up~0); 1834#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1908#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1907#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1795#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1796#L265 assume !(0 == ~q_read_ev~0); 1799#L265-2 assume !(0 == ~q_write_ev~0); 1905#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; 1862#L55 assume !(1 == ~p_dw_pc~0); 1812#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1811#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1902#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; 1874#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; 1825#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; 1826#L313 assume !(0 != activate_threads_~tmp___0~1); 1890#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1891#L283 assume !(1 == ~q_read_ev~0); 1885#L283-2 assume !(1 == ~q_write_ev~0); 1767#L288-1 assume { :end_inline_reset_delta_events } true; 1768#L409-3 [2018-11-18 13:14:07,582 INFO L796 eck$LassoCheckResult]: Loop: 1768#L409-3 assume true; 2068#L409-1 assume !false; 2067#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; 1973#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); 1963#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 1959#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1955#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; 1953#L334 assume !(0 != eval_~tmp___1~0); 1952#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 1950#L212-3 assume !(1 == ~q_req_up~0); 1948#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1947#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1815#L265-5 assume !(0 == ~q_write_ev~0); 1816#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; 1835#L55-3 assume !(1 == ~p_dw_pc~0); 1836#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 1914#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1915#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; 1910#L305-3 assume !(0 != activate_threads_~tmp~1); 1911#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; 1852#L74-3 assume !(1 == ~c_dr_pc~0); 1853#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1857#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1858#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; 1892#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1893#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1883#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1884#L283-5 assume !(1 == ~q_write_ev~0); 1894#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; 1895#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2074#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2073#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; 2072#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 2071#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 2070#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; 2069#L426 assume !(0 != start_simulation_~tmp~4); 1768#L409-3 [2018-11-18 13:14:07,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 2 times [2018-11-18 13:14:07,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:07,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2001597066, now seen corresponding path program 1 times [2018-11-18 13:14:07,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:14:07,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,621 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 13:14:07,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:14:07,621 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:07,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:07,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:07,622 INFO L87 Difference]: Start difference. First operand 319 states and 442 transitions. cyclomatic complexity: 125 Second operand 3 states. [2018-11-18 13:14:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:07,644 INFO L93 Difference]: Finished difference Result 507 states and 677 transitions. [2018-11-18 13:14:07,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:07,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 507 states and 677 transitions. [2018-11-18 13:14:07,646 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 400 [2018-11-18 13:14:07,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 507 states to 507 states and 677 transitions. [2018-11-18 13:14:07,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 507 [2018-11-18 13:14:07,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 507 [2018-11-18 13:14:07,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 507 states and 677 transitions. [2018-11-18 13:14:07,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:14:07,649 INFO L705 BuchiCegarLoop]: Abstraction has 507 states and 677 transitions. [2018-11-18 13:14:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states and 677 transitions. [2018-11-18 13:14:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2018-11-18 13:14:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-11-18 13:14:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 677 transitions. [2018-11-18 13:14:07,661 INFO L728 BuchiCegarLoop]: Abstraction has 507 states and 677 transitions. [2018-11-18 13:14:07,661 INFO L608 BuchiCegarLoop]: Abstraction has 507 states and 677 transitions. [2018-11-18 13:14:07,661 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:14:07,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 507 states and 677 transitions. [2018-11-18 13:14:07,664 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 400 [2018-11-18 13:14:07,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:07,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:07,665 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 13:14:07,665 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 13:14:07,665 INFO L794 eck$LassoCheckResult]: Stem: 2687#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; 2597#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; 2598#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; 2649#L212 assume !(1 == ~q_req_up~0); 2668#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2669#L227 assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 2819#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2818#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2817#L265 assume !(0 == ~q_read_ev~0); 2815#L265-2 assume !(0 == ~q_write_ev~0); 2813#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; 2811#L55 assume !(1 == ~p_dw_pc~0); 2808#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 2806#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2805#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; 2799#L305 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2798#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; 2797#L74 assume !(1 == ~c_dr_pc~0); 2796#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 2795#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2794#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; 2793#L313 assume !(0 != activate_threads_~tmp___0~1); 2792#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2791#L283 assume !(1 == ~q_read_ev~0); 2786#L283-2 assume !(1 == ~q_write_ev~0); 2787#L288-1 assume { :end_inline_reset_delta_events } true; 2997#L409-3 [2018-11-18 13:14:07,665 INFO L796 eck$LassoCheckResult]: Loop: 2997#L409-3 assume true; 2996#L409-1 assume !false; 2729#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; 2728#L354 assume true; 2727#L329-1 assume !false; 2726#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; 2724#L245 assume !(0 == ~p_dw_st~0); 2725#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 3046#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3045#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; 3044#L334 assume !(0 != eval_~tmp___1~0); 3042#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 3039#L212-3 assume !(1 == ~q_req_up~0); 3036#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 3033#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 3032#L265-5 assume !(0 == ~q_write_ev~0); 3031#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; 3030#L55-3 assume 1 == ~p_dw_pc~0; 3028#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 3027#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3026#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; 3025#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 3024#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; 3022#L74-3 assume !(1 == ~c_dr_pc~0); 3020#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 3018#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3016#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; 3014#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 3012#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3010#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 3009#L283-5 assume !(1 == ~q_write_ev~0); 3006#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; 3004#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3003#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3002#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; 3001#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3000#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 2999#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; 2998#L426 assume !(0 != start_simulation_~tmp~4); 2997#L409-3 [2018-11-18 13:14:07,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1896010065, now seen corresponding path program 1 times [2018-11-18 13:14:07,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,680 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 13:14:07,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:14:07,681 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:14:07,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash -185838867, now seen corresponding path program 1 times [2018-11-18 13:14:07,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,737 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 13:14:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:14:07,738 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:07,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:07,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:07,739 INFO L87 Difference]: Start difference. First operand 507 states and 677 transitions. cyclomatic complexity: 172 Second operand 3 states. [2018-11-18 13:14:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:07,743 INFO L93 Difference]: Finished difference Result 465 states and 619 transitions. [2018-11-18 13:14:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:07,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 619 transitions. [2018-11-18 13:14:07,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 400 [2018-11-18 13:14:07,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 465 states and 619 transitions. [2018-11-18 13:14:07,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 465 [2018-11-18 13:14:07,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 465 [2018-11-18 13:14:07,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 465 states and 619 transitions. [2018-11-18 13:14:07,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:14:07,748 INFO L705 BuchiCegarLoop]: Abstraction has 465 states and 619 transitions. [2018-11-18 13:14:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states and 619 transitions. [2018-11-18 13:14:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2018-11-18 13:14:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-18 13:14:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 619 transitions. [2018-11-18 13:14:07,754 INFO L728 BuchiCegarLoop]: Abstraction has 465 states and 619 transitions. [2018-11-18 13:14:07,754 INFO L608 BuchiCegarLoop]: Abstraction has 465 states and 619 transitions. [2018-11-18 13:14:07,754 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 13:14:07,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 465 states and 619 transitions. [2018-11-18 13:14:07,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 400 [2018-11-18 13:14:07,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:07,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:07,757 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 13:14:07,757 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 13:14:07,757 INFO L794 eck$LassoCheckResult]: Stem: 3667#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; 3578#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; 3579#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; 3632#L212 assume !(1 == ~q_req_up~0); 3647#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3596#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 3590#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 3591#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 3613#L265 assume !(0 == ~q_read_ev~0); 3614#L265-2 assume !(0 == ~q_write_ev~0); 3704#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; 3668#L55 assume !(1 == ~p_dw_pc~0); 3628#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 3627#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3701#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; 3688#L305 assume !(0 != activate_threads_~tmp~1); 3689#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; 3683#L74 assume !(1 == ~c_dr_pc~0); 3663#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 3664#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3640#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; 3641#L313 assume !(0 != activate_threads_~tmp___0~1); 3696#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3697#L283 assume !(1 == ~q_read_ev~0); 3691#L283-2 assume !(1 == ~q_write_ev~0); 3580#L288-1 assume { :end_inline_reset_delta_events } true; 3577#L409-3 [2018-11-18 13:14:07,757 INFO L796 eck$LassoCheckResult]: Loop: 3577#L409-3 assume true; 3570#L409-1 assume !false; 3571#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; 3727#L354 assume true; 3725#L329-1 assume !false; 3726#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; 3781#L245 assume !(0 == ~p_dw_st~0); 3597#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 3599#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4009#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; 4008#L334 assume !(0 != eval_~tmp___1~0); 3592#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 3593#L212-3 assume !(1 == ~q_req_up~0); 3645#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 3606#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 3607#L265-5 assume !(0 == ~q_write_ev~0); 3631#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; 3649#L55-3 assume 1 == ~p_dw_pc~0; 3621#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 3622#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3624#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; 3625#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 3674#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; 3661#L74-3 assume !(1 == ~c_dr_pc~0); 3658#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 3659#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3637#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; 3638#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 3681#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3682#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 3686#L283-5 assume !(1 == ~q_write_ev~0); 3687#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; 3698#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3617#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3618#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; 3584#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 3585#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 3588#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; 3589#L426 assume !(0 != start_simulation_~tmp~4); 3577#L409-3 [2018-11-18 13:14:07,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 3 times [2018-11-18 13:14:07,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:07,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash -185838867, now seen corresponding path program 2 times [2018-11-18 13:14:07,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:14:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,822 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 13:14:07,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:14:07,823 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:07,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:14:07,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:14:07,824 INFO L87 Difference]: Start difference. First operand 465 states and 619 transitions. cyclomatic complexity: 156 Second operand 5 states. [2018-11-18 13:14:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:07,874 INFO L93 Difference]: Finished difference Result 839 states and 1105 transitions. [2018-11-18 13:14:07,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:14:07,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 839 states and 1105 transitions. [2018-11-18 13:14:07,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 774 [2018-11-18 13:14:07,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 839 states to 839 states and 1105 transitions. [2018-11-18 13:14:07,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 839 [2018-11-18 13:14:07,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 839 [2018-11-18 13:14:07,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 839 states and 1105 transitions. [2018-11-18 13:14:07,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:14:07,882 INFO L705 BuchiCegarLoop]: Abstraction has 839 states and 1105 transitions. [2018-11-18 13:14:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states and 1105 transitions. [2018-11-18 13:14:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 471. [2018-11-18 13:14:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-11-18 13:14:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 617 transitions. [2018-11-18 13:14:07,892 INFO L728 BuchiCegarLoop]: Abstraction has 471 states and 617 transitions. [2018-11-18 13:14:07,892 INFO L608 BuchiCegarLoop]: Abstraction has 471 states and 617 transitions. [2018-11-18 13:14:07,892 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 13:14:07,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 471 states and 617 transitions. [2018-11-18 13:14:07,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 406 [2018-11-18 13:14:07,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:07,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:07,895 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 13:14:07,895 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 13:14:07,895 INFO L794 eck$LassoCheckResult]: Stem: 4991#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; 4898#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; 4899#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; 4951#L212 assume !(1 == ~q_req_up~0); 4967#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 4915#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4911#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4912#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 4932#L265 assume !(0 == ~q_read_ev~0); 4933#L265-2 assume !(0 == ~q_write_ev~0); 5039#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; 4994#L55 assume !(1 == ~p_dw_pc~0); 4946#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 4945#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5036#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; 5015#L305 assume !(0 != activate_threads_~tmp~1); 5016#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; 5009#L74 assume !(1 == ~c_dr_pc~0); 4986#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 4987#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4959#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; 4960#L313 assume !(0 != activate_threads_~tmp___0~1); 5024#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 5025#L283 assume !(1 == ~q_read_ev~0); 5019#L283-2 assume !(1 == ~q_write_ev~0); 4896#L288-1 assume { :end_inline_reset_delta_events } true; 4897#L409-3 [2018-11-18 13:14:07,896 INFO L796 eck$LassoCheckResult]: Loop: 4897#L409-3 assume true; 5142#L409-1 assume !false; 5143#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; 5105#L354 assume true; 5106#L329-1 assume !false; 5097#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; 5098#L245 assume !(0 == ~p_dw_st~0); 5091#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 5088#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5086#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; 5083#L334 assume !(0 != eval_~tmp___1~0); 5078#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 5073#L212-3 assume !(1 == ~q_req_up~0); 5068#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 5066#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 5064#L265-5 assume !(0 == ~q_write_ev~0); 5061#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; 5058#L55-3 assume !(1 == ~p_dw_pc~0); 5059#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 5053#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5054#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; 4997#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 4999#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; 5225#L74-3 assume !(1 == ~c_dr_pc~0); 5223#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 5221#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5219#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; 5217#L313-3 assume !(0 != activate_threads_~tmp___0~1); 5215#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 5213#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 5212#L283-5 assume !(1 == ~q_write_ev~0); 5173#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; 5209#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5206#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5204#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; 5202#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 5200#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 5198#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; 5194#L426 assume !(0 != start_simulation_~tmp~4); 4897#L409-3 [2018-11-18 13:14:07,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 4 times [2018-11-18 13:14:07,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:14:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:07,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash -41060086, now seen corresponding path program 1 times [2018-11-18 13:14:07,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:07,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:14:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:07,955 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 13:14:07,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:07,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:14:07,956 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:07,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:14:07,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:14:07,957 INFO L87 Difference]: Start difference. First operand 471 states and 617 transitions. cyclomatic complexity: 148 Second operand 5 states. [2018-11-18 13:14:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:07,998 INFO L93 Difference]: Finished difference Result 1102 states and 1444 transitions. [2018-11-18 13:14:07,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:14:07,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1102 states and 1444 transitions. [2018-11-18 13:14:08,003 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 939 [2018-11-18 13:14:08,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1102 states to 1102 states and 1444 transitions. [2018-11-18 13:14:08,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1102 [2018-11-18 13:14:08,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1102 [2018-11-18 13:14:08,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1102 states and 1444 transitions. [2018-11-18 13:14:08,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:14:08,008 INFO L705 BuchiCegarLoop]: Abstraction has 1102 states and 1444 transitions. [2018-11-18 13:14:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states and 1444 transitions. [2018-11-18 13:14:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 489. [2018-11-18 13:14:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-11-18 13:14:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 635 transitions. [2018-11-18 13:14:08,016 INFO L728 BuchiCegarLoop]: Abstraction has 489 states and 635 transitions. [2018-11-18 13:14:08,016 INFO L608 BuchiCegarLoop]: Abstraction has 489 states and 635 transitions. [2018-11-18 13:14:08,016 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 13:14:08,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 489 states and 635 transitions. [2018-11-18 13:14:08,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 418 [2018-11-18 13:14:08,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:08,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:08,018 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 13:14:08,018 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 13:14:08,019 INFO L794 eck$LassoCheckResult]: Stem: 6582#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; 6482#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; 6483#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; 6535#L212 assume !(1 == ~q_req_up~0); 6559#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 6501#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6502#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6514#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 6515#L265 assume !(0 == ~q_read_ev~0); 6516#L265-2 assume !(0 == ~q_write_ev~0); 6517#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; 6566#L55 assume !(1 == ~p_dw_pc~0); 6531#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 6579#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6532#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; 6533#L305 assume !(0 != activate_threads_~tmp~1); 6612#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; 6613#L74 assume !(1 == ~c_dr_pc~0); 6575#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 6576#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6543#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; 6544#L313 assume !(0 != activate_threads_~tmp___0~1); 6616#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6617#L283 assume !(1 == ~q_read_ev~0); 6610#L283-2 assume !(1 == ~q_write_ev~0); 6611#L288-1 assume { :end_inline_reset_delta_events } true; 6822#L409-3 [2018-11-18 13:14:08,019 INFO L796 eck$LassoCheckResult]: Loop: 6822#L409-3 assume true; 6821#L409-1 assume !false; 6820#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; 6799#L354 assume true; 6818#L329-1 assume !false; 6816#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; 6814#L245 assume !(0 == ~p_dw_st~0); 6503#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 6505#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6887#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; 6886#L334 assume !(0 != eval_~tmp___1~0); 6497#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 6498#L212-3 assume !(1 == ~q_req_up~0); 6548#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 6510#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 6511#L265-5 assume !(0 == ~q_write_ev~0); 6534#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; 6560#L55-3 assume 1 == ~p_dw_pc~0; 6524#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 6525#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6854#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; 6852#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 6850#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; 6848#L74-3 assume !(1 == ~c_dr_pc~0); 6846#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 6844#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6842#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; 6840#L313-3 assume !(0 != activate_threads_~tmp___0~1); 6838#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6836#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 6834#L283-5 assume !(1 == ~q_write_ev~0); 6831#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; 6829#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6828#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6827#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; 6826#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 6825#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 6824#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; 6823#L426 assume !(0 != start_simulation_~tmp~4); 6822#L409-3 [2018-11-18 13:14:08,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 5 times [2018-11-18 13:14:08,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:08,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:08,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:08,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:08,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:08,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash 72326571, now seen corresponding path program 1 times [2018-11-18 13:14:08,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:08,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:08,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:14:08,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:08,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash 832576701, now seen corresponding path program 1 times [2018-11-18 13:14:08,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:08,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:08,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:08,066 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 13:14:08,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:08,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:14:08,195 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2018-11-18 13:14:08,241 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:14:08,241 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:14:08,242 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:14:08,242 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:14:08,242 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:14:08,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:14:08,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:14:08,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:14:08,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-18 13:14:08,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:14:08,244 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:14:08,260 INFO 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 13:14:08,267 INFO 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 13:14:08,270 INFO 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 13:14:08,272 INFO 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 13:14:08,275 INFO 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 13:14:08,276 INFO 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 13:14:08,281 INFO 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 13:14:08,282 INFO 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 13:14:08,283 INFO 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 13:14:08,285 INFO 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 13:14:08,287 INFO 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 13:14:08,289 INFO 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 13:14:08,309 INFO 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 13:14:08,316 INFO 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 13:14:08,319 INFO 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 13:14:08,321 INFO 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 13:14:08,322 INFO 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 13:14:08,324 INFO 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 13:14:08,327 INFO 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 13:14:08,328 INFO 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 13:14:08,330 INFO 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 13:14:08,331 INFO 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 13:14:08,332 INFO 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 13:14:08,488 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:14:08,489 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/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 13:14:08,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:14:08,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:14:08,497 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:14:08,497 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_4102cdbf-369d-438c-95ec-0c113161b23e/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 13:14:08,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:14:08,514 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:14:08,516 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:14:08,516 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_4102cdbf-369d-438c-95ec-0c113161b23e/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 13:14:08,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:14:08,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:14:08,534 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:14:08,534 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_4102cdbf-369d-438c-95ec-0c113161b23e/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 13:14:08,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:14:08,550 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/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 13:14:08,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:14:08,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:14:08,572 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:14:08,607 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:14:08,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:14:08,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:14:08,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:14:08,608 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:14:08,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:14:08,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:14:08,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:14:08,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_2_true-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-18 13:14:08,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:14:08,608 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:14:08,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,640 INFO 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 13:14:08,649 INFO 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 13:14:08,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,663 INFO 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 13:14:08,665 INFO 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 13:14:08,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,673 INFO 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 13:14:08,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,677 INFO 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 13:14:08,678 INFO 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 13:14:08,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,680 INFO 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 13:14:08,682 INFO 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 13:14:08,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:14:08,837 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:14:08,841 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:14:08,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 13:14:08,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:14:08,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:14:08,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:14:08,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:14:08,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:14:08,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:14:08,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:14:08,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:14:08,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:14:08,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:14:08,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:14:08,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:14:08,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:14:08,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:14:08,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:14:08,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:14:08,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:14:08,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:14:08,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:14:08,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:14:08,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:14:08,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:14:08,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:14:08,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:14:08,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:14:08,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:14:08,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:14:08,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:14:08,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:14:08,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:14:08,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:14:08,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:14:08,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:14:08,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:14:08,856 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:14:08,859 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:14:08,860 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:14:08,861 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:14:08,861 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:14:08,861 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:14:08,862 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 13:14:08,863 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:14:08,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:08,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:14:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:08,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:14:08,938 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 13:14:08,941 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 13:14:08,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 489 states and 635 transitions. cyclomatic complexity: 148 Second operand 5 states. [2018-11-18 13:14:09,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 489 states and 635 transitions. cyclomatic complexity: 148. Second operand 5 states. Result 1369 states and 1785 transitions. Complement of second has 5 states. [2018-11-18 13:14:09,012 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 13:14:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:14:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2018-11-18 13:14:09,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 141 transitions. Stem has 26 letters. Loop has 39 letters. [2018-11-18 13:14:09,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:14:09,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 141 transitions. Stem has 65 letters. Loop has 39 letters. [2018-11-18 13:14:09,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:14:09,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 141 transitions. Stem has 26 letters. Loop has 78 letters. [2018-11-18 13:14:09,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:14:09,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1369 states and 1785 transitions. [2018-11-18 13:14:09,025 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 836 [2018-11-18 13:14:09,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1369 states to 1369 states and 1785 transitions. [2018-11-18 13:14:09,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 917 [2018-11-18 13:14:09,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 931 [2018-11-18 13:14:09,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1369 states and 1785 transitions. [2018-11-18 13:14:09,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:14:09,030 INFO L705 BuchiCegarLoop]: Abstraction has 1369 states and 1785 transitions. [2018-11-18 13:14:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states and 1785 transitions. [2018-11-18 13:14:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1355. [2018-11-18 13:14:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2018-11-18 13:14:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1771 transitions. [2018-11-18 13:14:09,045 INFO L728 BuchiCegarLoop]: Abstraction has 1355 states and 1771 transitions. [2018-11-18 13:14:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:09,045 INFO L87 Difference]: Start difference. First operand 1355 states and 1771 transitions. Second operand 3 states. [2018-11-18 13:14:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:09,071 INFO L93 Difference]: Finished difference Result 1355 states and 1735 transitions. [2018-11-18 13:14:09,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:09,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1355 states and 1735 transitions. [2018-11-18 13:14:09,076 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 836 [2018-11-18 13:14:09,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1355 states to 1355 states and 1735 transitions. [2018-11-18 13:14:09,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 917 [2018-11-18 13:14:09,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 917 [2018-11-18 13:14:09,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1355 states and 1735 transitions. [2018-11-18 13:14:09,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:14:09,080 INFO L705 BuchiCegarLoop]: Abstraction has 1355 states and 1735 transitions. [2018-11-18 13:14:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states and 1735 transitions. [2018-11-18 13:14:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2018-11-18 13:14:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2018-11-18 13:14:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1735 transitions. [2018-11-18 13:14:09,092 INFO L728 BuchiCegarLoop]: Abstraction has 1355 states and 1735 transitions. [2018-11-18 13:14:09,092 INFO L608 BuchiCegarLoop]: Abstraction has 1355 states and 1735 transitions. [2018-11-18 13:14:09,092 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 13:14:09,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1355 states and 1735 transitions. [2018-11-18 13:14:09,095 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 836 [2018-11-18 13:14:09,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:09,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:09,096 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 13:14:09,096 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 13:14:09,096 INFO L794 eck$LassoCheckResult]: Stem: 11450#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; 11277#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; 11278#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; 11367#L212 assume !(1 == ~q_req_up~0); 11411#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 11510#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 11303#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 11304#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 11340#L265 assume !(0 == ~q_read_ev~0); 11341#L265-2 assume !(0 == ~q_write_ev~0); 11429#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; 11430#L55 assume !(1 == ~p_dw_pc~0); 11362#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 11507#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 11506#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; 11505#L305 assume !(0 != activate_threads_~tmp~1); 11484#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; 11485#L74 assume !(1 == ~c_dr_pc~0); 11504#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 11467#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 11468#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; 11486#L313 assume !(0 != activate_threads_~tmp___0~1); 11487#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 11503#L283 assume !(1 == ~q_read_ev~0); 11482#L283-2 assume !(1 == ~q_write_ev~0); 11483#L288-1 assume { :end_inline_reset_delta_events } true; 11727#L409-3 assume true; 11728#L409-1 [2018-11-18 13:14:09,097 INFO L796 eck$LassoCheckResult]: Loop: 11728#L409-1 assume !false; 12169#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; 12167#L354 assume true; 12165#L329-1 assume !false; 12163#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; 12161#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 12159#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 12157#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; 12155#L334 assume 0 != eval_~tmp___1~0; 12153#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 12150#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 12148#L118 assume 0 == ~p_dw_pc~0; 12144#L129-2 assume true; 12142#L129 assume !false; 12139#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 12042#L148 assume { :end_inline_do_write_p } true; 11954#L339 assume !(0 == ~c_dr_st~0); 11952#L354 assume true; 11950#L329-1 assume !false; 11947#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; 11945#L245 assume !(0 == ~p_dw_st~0); 11942#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 11940#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11937#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; 11934#L334 assume !(0 != eval_~tmp___1~0); 11932#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 11929#L212-3 assume !(1 == ~q_req_up~0); 11930#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 12231#L265-3 assume !(0 == ~q_read_ev~0); 12229#L265-5 assume !(0 == ~q_write_ev~0); 11856#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; 12226#L55-3 assume 1 == ~p_dw_pc~0; 12220#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 12218#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 12216#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; 12213#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 12211#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; 12209#L74-3 assume !(1 == ~c_dr_pc~0); 12207#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 12205#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 12203#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; 12200#L313-3 assume !(0 != activate_threads_~tmp___0~1); 12197#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 12195#L283-3 assume !(1 == ~q_read_ev~0); 12193#L283-5 assume !(1 == ~q_write_ev~0); 12184#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; 12180#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 12179#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 12178#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; 12176#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 12175#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 12174#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; 12173#L426 assume !(0 != start_simulation_~tmp~4); 12172#L409-3 assume true; 11728#L409-1 [2018-11-18 13:14:09,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1392540969, now seen corresponding path program 1 times [2018-11-18 13:14:09,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1334432163, now seen corresponding path program 1 times [2018-11-18 13:14:09,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:09,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:09,148 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 13:14:09,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:09,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:14:09,149 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:09,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:09,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:09,149 INFO L87 Difference]: Start difference. First operand 1355 states and 1735 transitions. cyclomatic complexity: 386 Second operand 3 states. [2018-11-18 13:14:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:09,168 INFO L93 Difference]: Finished difference Result 1578 states and 1967 transitions. [2018-11-18 13:14:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:09,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1578 states and 1967 transitions. [2018-11-18 13:14:09,173 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 796 [2018-11-18 13:14:09,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1578 states to 1464 states and 1835 transitions. [2018-11-18 13:14:09,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 965 [2018-11-18 13:14:09,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 965 [2018-11-18 13:14:09,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1464 states and 1835 transitions. [2018-11-18 13:14:09,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:14:09,179 INFO L705 BuchiCegarLoop]: Abstraction has 1464 states and 1835 transitions. [2018-11-18 13:14:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states and 1835 transitions. [2018-11-18 13:14:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2018-11-18 13:14:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-11-18 13:14:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1835 transitions. [2018-11-18 13:14:09,191 INFO L728 BuchiCegarLoop]: Abstraction has 1464 states and 1835 transitions. [2018-11-18 13:14:09,191 INFO L608 BuchiCegarLoop]: Abstraction has 1464 states and 1835 transitions. [2018-11-18 13:14:09,191 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 13:14:09,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1464 states and 1835 transitions. [2018-11-18 13:14:09,195 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 796 [2018-11-18 13:14:09,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:09,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:09,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, 1, 1, 1] [2018-11-18 13:14:09,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:14:09,195 INFO L794 eck$LassoCheckResult]: Stem: 14385#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; 14215#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; 14216#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; 14305#L212 assume !(1 == ~q_req_up~0); 14336#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 14247#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 14248#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 14274#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 14275#L265 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 14491#L265-2 assume !(0 == ~q_write_ev~0); 14488#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; 14485#L55 assume !(1 == ~p_dw_pc~0); 14481#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 14477#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 14472#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; 14467#L305 assume !(0 != activate_threads_~tmp~1); 14463#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; 14460#L74 assume !(1 == ~c_dr_pc~0); 14457#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 14454#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 14452#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; 14449#L313 assume !(0 != activate_threads_~tmp___0~1); 14446#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 14442#L283 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 14427#L283-2 assume !(1 == ~q_write_ev~0); 14428#L288-1 assume { :end_inline_reset_delta_events } true; 14564#L409-3 assume true; 14565#L409-1 assume !false; 15232#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; 15230#L354 [2018-11-18 13:14:09,196 INFO L796 eck$LassoCheckResult]: Loop: 15230#L354 assume true; 15228#L329-1 assume !false; 15226#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; 15224#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 15222#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 15220#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; 15218#L334 assume 0 != eval_~tmp___1~0; 15215#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 15211#L343 assume !(0 != eval_~tmp~2); 15212#L339 assume !(0 == ~c_dr_st~0); 15230#L354 [2018-11-18 13:14:09,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2017086059, now seen corresponding path program 1 times [2018-11-18 13:14:09,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:09,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:09,224 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 13:14:09,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:09,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:14:09,225 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:14:09,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash -544530888, now seen corresponding path program 1 times [2018-11-18 13:14:09,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:09,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:09,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:09,251 INFO L87 Difference]: Start difference. First operand 1464 states and 1835 transitions. cyclomatic complexity: 385 Second operand 3 states. [2018-11-18 13:14:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:09,301 INFO L93 Difference]: Finished difference Result 2415 states and 3020 transitions. [2018-11-18 13:14:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:09,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2415 states and 3020 transitions. [2018-11-18 13:14:09,312 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 1334 [2018-11-18 13:14:09,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2415 states to 2042 states and 2545 transitions. [2018-11-18 13:14:09,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1583 [2018-11-18 13:14:09,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1709 [2018-11-18 13:14:09,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2042 states and 2545 transitions. [2018-11-18 13:14:09,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:14:09,323 INFO L705 BuchiCegarLoop]: Abstraction has 2042 states and 2545 transitions. [2018-11-18 13:14:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states and 2545 transitions. [2018-11-18 13:14:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1208. [2018-11-18 13:14:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-11-18 13:14:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1509 transitions. [2018-11-18 13:14:09,342 INFO L728 BuchiCegarLoop]: Abstraction has 1208 states and 1509 transitions. [2018-11-18 13:14:09,342 INFO L608 BuchiCegarLoop]: Abstraction has 1208 states and 1509 transitions. [2018-11-18 13:14:09,342 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 13:14:09,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1208 states and 1509 transitions. [2018-11-18 13:14:09,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 716 [2018-11-18 13:14:09,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:09,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:09,347 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 13:14:09,347 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, 1] [2018-11-18 13:14:09,347 INFO L794 eck$LassoCheckResult]: Stem: 18255#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; 18100#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; 18101#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; 18183#L212 assume !(1 == ~q_req_up~0); 18222#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 18132#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 18126#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 18127#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 18156#L265 assume !(0 == ~q_read_ev~0); 18157#L265-2 assume !(0 == ~q_write_ev~0); 18158#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; 18239#L55 assume !(1 == ~p_dw_pc~0); 18178#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 18254#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 18179#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; 18180#L305 assume !(0 != activate_threads_~tmp~1); 18281#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; 18271#L74 assume !(1 == ~c_dr_pc~0); 18250#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 18251#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 18202#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; 18203#L313 assume !(0 != activate_threads_~tmp___0~1); 18287#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 18260#L283 assume !(1 == ~q_read_ev~0); 18261#L283-2 assume !(1 == ~q_write_ev~0); 18286#L288-1 assume { :end_inline_reset_delta_events } true; 19000#L409-3 [2018-11-18 13:14:09,347 INFO L796 eck$LassoCheckResult]: Loop: 19000#L409-3 assume true; 18528#L409-1 assume !false; 18668#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; 18664#L354 assume true; 18663#L329-1 assume !false; 18662#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; 18661#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 18660#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 18659#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; 18658#L334 assume 0 != eval_~tmp___1~0; 18656#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 18657#L343 assume 0 != eval_~tmp~2;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet2; 18688#L118 assume 0 == ~p_dw_pc~0; 19068#L129-2 assume true; 19067#L129 assume !false; 19065#L130 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 19057#L148 assume { :end_inline_do_write_p } true; 19038#L339 assume !(0 == ~c_dr_st~0); 19032#L354 assume true; 19029#L329-1 assume !false; 19026#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; 19023#L245 assume !(0 == ~p_dw_st~0); 19018#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 19014#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 19011#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; 19006#L334 assume !(0 != eval_~tmp___1~0); 18998#L370 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 18999#L212-3 assume 1 == ~q_req_up~0;assume { :begin_inline_update_fifo_q } true; 18993#L25-3 assume 0 == ~q_free~0;~q_write_ev~0 := 0; 18946#L25-5 assume 1 == ~q_free~0;~q_read_ev~0 := 0; 18944#L30-3 ~q_ev~0 := 0;~q_req_up~0 := 0; 18941#L38-1 assume { :end_inline_update_fifo_q } true; 18940#L212-5 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 18939#L265-3 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 18596#L265-5 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 19153#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; 19149#L55-3 assume 1 == ~p_dw_pc~0; 19147#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 18171#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 19145#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; 19141#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 19139#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; 19137#L74-3 assume !(1 == ~c_dr_pc~0); 19135#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 19133#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 19131#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; 19129#L313-3 assume !(0 != activate_threads_~tmp___0~1); 19127#L313-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 19125#L283-3 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 19122#L283-5 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 19121#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; 19120#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 19119#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 19118#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; 19117#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 19116#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 19115#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; 19114#L426 assume !(0 != start_simulation_~tmp~4); 19000#L409-3 [2018-11-18 13:14:09,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1617647313, now seen corresponding path program 6 times [2018-11-18 13:14:09,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:09,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1205551460, now seen corresponding path program 1 times [2018-11-18 13:14:09,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:14:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:09,377 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 13:14:09,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:09,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:14:09,378 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:14:09,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:09,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:09,378 INFO L87 Difference]: Start difference. First operand 1208 states and 1509 transitions. cyclomatic complexity: 313 Second operand 3 states. [2018-11-18 13:14:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:09,408 INFO L93 Difference]: Finished difference Result 1520 states and 1883 transitions. [2018-11-18 13:14:09,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:09,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1520 states and 1883 transitions. [2018-11-18 13:14:09,415 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 902 [2018-11-18 13:14:09,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1520 states to 1520 states and 1883 transitions. [2018-11-18 13:14:09,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1116 [2018-11-18 13:14:09,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1116 [2018-11-18 13:14:09,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1520 states and 1883 transitions. [2018-11-18 13:14:09,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:14:09,422 INFO L705 BuchiCegarLoop]: Abstraction has 1520 states and 1883 transitions. [2018-11-18 13:14:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states and 1883 transitions. [2018-11-18 13:14:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1496. [2018-11-18 13:14:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 13:14:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1859 transitions. [2018-11-18 13:14:09,440 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1859 transitions. [2018-11-18 13:14:09,440 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1859 transitions. [2018-11-18 13:14:09,441 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 13:14:09,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1859 transitions. [2018-11-18 13:14:09,445 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 885 [2018-11-18 13:14:09,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:09,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:09,445 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] [2018-11-18 13:14:09,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:14:09,446 INFO L794 eck$LassoCheckResult]: Stem: 21000#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; 20835#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; 20836#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; 20927#L212 assume !(1 == ~q_req_up~0); 20965#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 20868#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 20869#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 20896#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 20897#L265 assume !(0 == ~q_read_ev~0); 20898#L265-2 assume !(0 == ~q_write_ev~0); 20899#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; 20982#L55 assume !(1 == ~p_dw_pc~0); 20922#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 20999#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 21001#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; 21042#L305 assume !(0 != activate_threads_~tmp~1); 21043#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; 21163#L74 assume !(1 == ~c_dr_pc~0); 21162#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 21028#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 21029#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; 21050#L313 assume !(0 != activate_threads_~tmp___0~1); 21051#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 21161#L283 assume !(1 == ~q_read_ev~0); 21047#L283-2 assume !(1 == ~q_write_ev~0); 21048#L288-1 assume { :end_inline_reset_delta_events } true; 21496#L409-3 assume true; 21098#L409-1 assume !false; 22156#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; 21483#L354 [2018-11-18 13:14:09,446 INFO L796 eck$LassoCheckResult]: Loop: 21483#L354 assume true; 21492#L329-1 assume !false; 21491#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; 21490#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 21489#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 21488#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; 21487#L334 assume 0 != eval_~tmp___1~0; 21486#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 21485#L343 assume !(0 != eval_~tmp~2); 21484#L339 assume !(0 == ~c_dr_st~0); 21483#L354 [2018-11-18 13:14:09,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1797921109, now seen corresponding path program 1 times [2018-11-18 13:14:09,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash -544530888, now seen corresponding path program 2 times [2018-11-18 13:14:09,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:09,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2036844446, now seen corresponding path program 1 times [2018-11-18 13:14:09,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:14:09,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:14:09,481 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 13:14:09,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:14:09,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:14:09,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:14:09,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:14:09,510 INFO L87 Difference]: Start difference. First operand 1496 states and 1859 transitions. cyclomatic complexity: 372 Second operand 3 states. [2018-11-18 13:14:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:14:09,529 INFO L93 Difference]: Finished difference Result 1643 states and 2000 transitions. [2018-11-18 13:14:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:14:09,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1643 states and 2000 transitions. [2018-11-18 13:14:09,535 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1091 [2018-11-18 13:14:09,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1643 states to 1643 states and 2000 transitions. [2018-11-18 13:14:09,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1232 [2018-11-18 13:14:09,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1232 [2018-11-18 13:14:09,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1643 states and 2000 transitions. [2018-11-18 13:14:09,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:14:09,542 INFO L705 BuchiCegarLoop]: Abstraction has 1643 states and 2000 transitions. [2018-11-18 13:14:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states and 2000 transitions. [2018-11-18 13:14:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1643. [2018-11-18 13:14:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2018-11-18 13:14:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2000 transitions. [2018-11-18 13:14:09,562 INFO L728 BuchiCegarLoop]: Abstraction has 1643 states and 2000 transitions. [2018-11-18 13:14:09,562 INFO L608 BuchiCegarLoop]: Abstraction has 1643 states and 2000 transitions. [2018-11-18 13:14:09,562 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 13:14:09,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1643 states and 2000 transitions. [2018-11-18 13:14:09,566 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1091 [2018-11-18 13:14:09,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:14:09,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:14:09,566 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] [2018-11-18 13:14:09,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:14:09,567 INFO L794 eck$LassoCheckResult]: Stem: 24153#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; 23981#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; 23982#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; 24071#L212 assume !(1 == ~q_req_up~0); 24113#L212-2 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 24014#L227 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 24015#L227-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 24038#L232-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 24039#L265 assume !(0 == ~q_read_ev~0); 24040#L265-2 assume !(0 == ~q_write_ev~0); 24041#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; 24131#L55 assume !(1 == ~p_dw_pc~0); 24064#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 24154#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 24155#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; 24191#L305 assume !(0 != activate_threads_~tmp~1); 24192#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; 24181#L74 assume !(1 == ~c_dr_pc~0); 24145#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 24146#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 24089#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; 24090#L313 assume !(0 != activate_threads_~tmp___0~1); 24204#L313-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 24205#L283 assume !(1 == ~q_read_ev~0); 24198#L283-2 assume !(1 == ~q_write_ev~0); 24199#L288-1 assume { :end_inline_reset_delta_events } true; 24634#L409-3 assume true; 24324#L409-1 assume !false; 24851#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; 24722#L354 [2018-11-18 13:14:09,567 INFO L796 eck$LassoCheckResult]: Loop: 24722#L354 assume true; 24832#L329-1 assume !false; 24828#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; 24824#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 24820#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 24749#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; 24746#L334 assume 0 != eval_~tmp___1~0; 24744#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 24733#L343 assume !(0 != eval_~tmp~2); 24727#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 24721#L358 assume !(0 != eval_~tmp___0~2); 24722#L354 [2018-11-18 13:14:09,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1797921109, now seen corresponding path program 2 times [2018-11-18 13:14:09,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:09,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash 299409972, now seen corresponding path program 1 times [2018-11-18 13:14:09,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:14:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:14:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1282329930, now seen corresponding path program 1 times [2018-11-18 13:14:09,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:14:09,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:14:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:14:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:14:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:14:09,793 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-11-18 13:14:09,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:14:09 BoogieIcfgContainer [2018-11-18 13:14:09,864 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:14:09,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:14:09,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:14:09,865 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:14:09,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:14:06" (3/4) ... [2018-11-18 13:14:09,870 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 13:14:09,912 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4102cdbf-369d-438c-95ec-0c113161b23e/bin-2019/uautomizer/witness.graphml [2018-11-18 13:14:09,912 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:14:09,913 INFO L168 Benchmark]: Toolchain (without parser) took 3636.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 953.8 MB in the beginning and 829.2 MB in the end (delta: 124.5 MB). Peak memory consumption was 337.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:14:09,913 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:14:09,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.40 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:14:09,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.49 ms. Allocated memory is still 1.0 GB. Free memory is still 937.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:14:09,914 INFO L168 Benchmark]: Boogie Preprocessor took 60.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:14:09,914 INFO L168 Benchmark]: RCFGBuilder took 351.59 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: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:14:09,914 INFO L168 Benchmark]: BuchiAutomizer took 2941.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 834.3 MB in the end (delta: 275.2 MB). Peak memory consumption was 340.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:14:09,915 INFO L168 Benchmark]: Witness Printer took 47.86 ms. Allocated memory is still 1.2 GB. Free memory was 834.3 MB in the beginning and 829.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:14:09,916 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 204.40 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.49 ms. Allocated memory is still 1.0 GB. Free memory is still 937.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 351.59 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: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2941.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 834.3 MB in the end (delta: 275.2 MB). Peak memory consumption was 340.2 MB. Max. memory is 11.5 GB. * Witness Printer took 47.86 ms. Allocated memory is still 1.2 GB. Free memory was 834.3 MB in the beginning and 829.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (13 trivial, 1 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. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1643 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 2011 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1643 states and ocurred in iteration 13. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2045 SDtfs, 1976 SDslu, 2471 SDs, 0 SdLazy, 205 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc1 concLT1 SILN1 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp13 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 329]: 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=0, c_dr_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cc798ba=0, c_dr_pc=0, a_t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b0f3ccf=0, \result=0, \result=0, c_num_read=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73aa5661=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___1=1, q_req_up=0, tmp___0=0, q_write_ev=2, __retres1=1, p_dw_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44f3dca5=0, q_free=1, __retres1=0, p_dw_st=0, \result=0, q_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@649182ed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e2fcda0=0, c_last_read=0, tmp___0=0, __retres1=0, tmp=0, p_num_write=0, q_buf_0=0, __retres1=0, tmp=0, \result=1} - 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 ; Loop: [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 FALSE !(\read(tmp)) [L354] COND TRUE (int )c_dr_st == 0 [L356] tmp___0 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...