./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/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.24-cad4683 [2019-11-15 20:33:41,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:33:41,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:33:41,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:33:41,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:33:41,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:33:41,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:33:41,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:33:41,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:33:41,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:33:41,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:33:41,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:33:41,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:33:41,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:33:41,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:33:41,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:33:41,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:33:41,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:33:41,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:33:41,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:33:41,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:33:41,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:33:41,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:33:41,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:33:41,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:33:41,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:33:41,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:33:41,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:33:41,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:33:41,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:33:41,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:33:41,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:33:41,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:33:41,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:33:41,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:33:41,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:33:41,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:33:41,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:33:41,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:33:41,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:33:41,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:33:41,431 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:33:41,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:33:41,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:33:41,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:33:41,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:33:41,466 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:33:41,466 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:33:41,467 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:33:41,467 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:33:41,467 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:33:41,467 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:33:41,468 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:33:41,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:33:41,468 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:33:41,468 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:33:41,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:33:41,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:33:41,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:33:41,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:33:41,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:33:41,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:33:41,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:33:41,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:33:41,471 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:33:41,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:33:41,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:33:41,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:33:41,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:33:41,472 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:33:41,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:33:41,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:33:41,473 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:33:41,474 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:33:41,474 INFO L138 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/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/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 [2019-11-15 20:33:41,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:33:41,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:33:41,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:33:41,554 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:33:41,554 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:33:41,555 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2019-11-15 20:33:41,623 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/data/50d431a0f/1a7b1b289b604ae5b009b478d239cbbc/FLAG86cbaa25b [2019-11-15 20:33:42,046 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:33:42,046 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2019-11-15 20:33:42,055 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/data/50d431a0f/1a7b1b289b604ae5b009b478d239cbbc/FLAG86cbaa25b [2019-11-15 20:33:42,469 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/data/50d431a0f/1a7b1b289b604ae5b009b478d239cbbc [2019-11-15 20:33:42,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:33:42,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:33:42,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:33:42,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:33:42,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:33:42,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:33:42" (1/1) ... [2019-11-15 20:33:42,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f09ad54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:42, skipping insertion in model container [2019-11-15 20:33:42,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:33:42" (1/1) ... [2019-11-15 20:33:42,497 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:33:42,557 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:33:43,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:33:43,020 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:33:43,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:33:43,144 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:33:43,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43 WrapperNode [2019-11-15 20:33:43,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:33:43,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:33:43,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:33:43,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:33:43,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... [2019-11-15 20:33:43,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... [2019-11-15 20:33:43,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:33:43,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:33:43,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:33:43,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:33:43,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... [2019-11-15 20:33:43,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... [2019-11-15 20:33:43,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... [2019-11-15 20:33:43,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... [2019-11-15 20:33:43,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... [2019-11-15 20:33:43,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... [2019-11-15 20:33:43,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... [2019-11-15 20:33:43,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:33:43,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:33:43,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:33:43,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:33:43,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/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 [2019-11-15 20:33:43,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:33:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:33:43,904 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:33:43,905 INFO L284 CfgBuilder]: Removed 58 assume(true) statements. [2019-11-15 20:33:43,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:33:43 BoogieIcfgContainer [2019-11-15 20:33:43,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:33:43,907 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:33:43,907 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:33:43,911 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:33:43,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:33:43,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:33:42" (1/3) ... [2019-11-15 20:33:43,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@725d7376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:33:43, skipping insertion in model container [2019-11-15 20:33:43,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:33:43,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:33:43" (2/3) ... [2019-11-15 20:33:43,914 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@725d7376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:33:43, skipping insertion in model container [2019-11-15 20:33:43,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:33:43,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:33:43" (3/3) ... [2019-11-15 20:33:43,916 INFO L371 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-11-15 20:33:43,961 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:33:43,961 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:33:43,961 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:33:43,961 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:33:43,961 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:33:43,961 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:33:43,962 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:33:43,962 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:33:43,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states. [2019-11-15 20:33:44,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-11-15 20:33:44,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:44,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:44,019 INFO L849 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] [2019-11-15 20:33:44,019 INFO L850 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] [2019-11-15 20:33:44,019 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:33:44,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states. [2019-11-15 20:33:44,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-11-15 20:33:44,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:44,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:44,028 INFO L849 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] [2019-11-15 20:33:44,029 INFO L850 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] [2019-11-15 20:33:44,037 INFO L791 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue ~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; 13#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 76#L452true 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; 10#L212true assume !(1 == ~q_req_up~0); 9#L212-1true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 43#L227-1true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 56#L232-1true assume !(0 == ~q_read_ev~0); 59#L265-1true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 21#L270-1true 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 42#L55true assume 1 == ~p_dw_pc~0; 72#L56true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 44#L66true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 74#L67true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 69#L305true assume !(0 != activate_threads_~tmp~1); 75#L305-2true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 62#L74true assume !(1 == ~c_dr_pc~0); 31#L74-2true is_do_read_c_triggered_~__retres1~1 := 0; 63#L85true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 90#L86true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 77#L313true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 78#L313-2true assume !(1 == ~q_read_ev~0); 50#L283-1true assume !(1 == ~q_write_ev~0); 3#L409-1true [2019-11-15 20:33:44,039 INFO L793 eck$LassoCheckResult]: Loop: 3#L409-1true assume !false; 47#L410true start_simulation_~kernel_st~0 := 1;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 false; 40#L370true start_simulation_~kernel_st~0 := 2; 7#L212-2true assume !(1 == ~q_req_up~0); 5#L212-3true start_simulation_~kernel_st~0 := 3; 57#L265-2true assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 51#L265-4true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 15#L270-3true 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 11#L55-3true assume 1 == ~p_dw_pc~0; 68#L56-1true assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 41#L66-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 70#L67-1true activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 53#L305-3true assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 58#L305-5true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 29#L74-3true assume 1 == ~c_dr_pc~0; 86#L75-1true assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 33#L85-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 87#L86-1true activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 80#L313-3true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 61#L313-5true assume !(1 == ~q_read_ev~0); 73#L283-3true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 81#L288-3true 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 12#L245-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 65#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 91#L258-1true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 32#L384true assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 18#L391true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L392true start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 83#L426true assume !(0 != start_simulation_~tmp~4); 3#L409-1true [2019-11-15 20:33:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:44,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1146955365, now seen corresponding path program 1 times [2019-11-15 20:33:44,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:44,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65440632] [2019-11-15 20:33:44,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:44,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65440632] [2019-11-15 20:33:44,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:44,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:44,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287949558] [2019-11-15 20:33:44,226 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:33:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -518202494, now seen corresponding path program 1 times [2019-11-15 20:33:44,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:44,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124388210] [2019-11-15 20:33:44,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:44,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124388210] [2019-11-15 20:33:44,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:44,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:33:44,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755857819] [2019-11-15 20:33:44,277 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:44,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:44,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:33:44,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:33:44,301 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2019-11-15 20:33:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:44,331 INFO L93 Difference]: Finished difference Result 92 states and 135 transitions. [2019-11-15 20:33:44,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:33:44,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 135 transitions. [2019-11-15 20:33:44,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-11-15 20:33:44,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 86 states and 129 transitions. [2019-11-15 20:33:44,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2019-11-15 20:33:44,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2019-11-15 20:33:44,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 129 transitions. [2019-11-15 20:33:44,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:44,350 INFO L688 BuchiCegarLoop]: Abstraction has 86 states and 129 transitions. [2019-11-15 20:33:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 129 transitions. [2019-11-15 20:33:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-15 20:33:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-15 20:33:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions. [2019-11-15 20:33:44,387 INFO L711 BuchiCegarLoop]: Abstraction has 86 states and 129 transitions. [2019-11-15 20:33:44,387 INFO L591 BuchiCegarLoop]: Abstraction has 86 states and 129 transitions. [2019-11-15 20:33:44,387 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:33:44,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 129 transitions. [2019-11-15 20:33:44,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-11-15 20:33:44,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:44,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:44,392 INFO L849 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] [2019-11-15 20:33:44,392 INFO L850 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] [2019-11-15 20:33:44,393 INFO L791 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY ~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; 215#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 216#L452 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; 213#L212 assume !(1 == ~q_req_up~0); 206#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 207#L227-1 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 252#L232-1 assume !(0 == ~q_read_ev~0); 262#L265-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 227#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 228#L55 assume 1 == ~p_dw_pc~0; 251#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 245#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 253#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 273#L305 assume !(0 != activate_threads_~tmp~1); 274#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 265#L74 assume !(1 == ~c_dr_pc~0); 236#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 237#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 267#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 276#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 277#L313-2 assume !(1 == ~q_read_ev~0); 255#L283-1 assume !(1 == ~q_write_ev~0); 193#L409-1 [2019-11-15 20:33:44,393 INFO L793 eck$LassoCheckResult]: Loop: 193#L409-1 assume !false; 194#L410 start_simulation_~kernel_st~0 := 1;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; 195#L354 assume !false; 196#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 241#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 242#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 270#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 256#L334 assume !(0 != eval_~tmp___1~0); 249#L370 start_simulation_~kernel_st~0 := 2; 202#L212-2 assume !(1 == ~q_req_up~0); 197#L212-3 start_simulation_~kernel_st~0 := 3; 198#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 258#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 219#L270-3 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 208#L55-3 assume 1 == ~p_dw_pc~0; 209#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 205#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 250#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 259#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 260#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 234#L74-3 assume !(1 == ~c_dr_pc~0); 231#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 232#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 239#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 278#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 263#L313-5 assume !(1 == ~q_read_ev~0); 264#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 275#L288-3 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 210#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 211#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 269#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 238#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 221#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 222#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 248#L426 assume !(0 != start_simulation_~tmp~4); 193#L409-1 [2019-11-15 20:33:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1153867225, now seen corresponding path program 1 times [2019-11-15 20:33:44,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:44,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723543992] [2019-11-15 20:33:44,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:44,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723543992] [2019-11-15 20:33:44,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:44,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:44,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515021775] [2019-11-15 20:33:44,434 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:33:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:44,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171118, now seen corresponding path program 1 times [2019-11-15 20:33:44,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:44,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727811929] [2019-11-15 20:33:44,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:44,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727811929] [2019-11-15 20:33:44,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:44,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:44,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980617198] [2019-11-15 20:33:44,480 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:44,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:33:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:33:44,481 INFO L87 Difference]: Start difference. First operand 86 states and 129 transitions. cyclomatic complexity: 44 Second operand 3 states. [2019-11-15 20:33:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:44,516 INFO L93 Difference]: Finished difference Result 86 states and 128 transitions. [2019-11-15 20:33:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:33:44,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 128 transitions. [2019-11-15 20:33:44,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-11-15 20:33:44,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 128 transitions. [2019-11-15 20:33:44,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2019-11-15 20:33:44,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2019-11-15 20:33:44,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 128 transitions. [2019-11-15 20:33:44,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:44,524 INFO L688 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-11-15 20:33:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 128 transitions. [2019-11-15 20:33:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-15 20:33:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-15 20:33:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2019-11-15 20:33:44,542 INFO L711 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-11-15 20:33:44,542 INFO L591 BuchiCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-11-15 20:33:44,542 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:33:44,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 128 transitions. [2019-11-15 20:33:44,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-11-15 20:33:44,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:44,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:44,557 INFO L849 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] [2019-11-15 20:33:44,557 INFO L850 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] [2019-11-15 20:33:44,557 INFO L791 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY ~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; 394#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 395#L452 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; 387#L212 assume !(1 == ~q_req_up~0); 385#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 386#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 431#L232-1 assume !(0 == ~q_read_ev~0); 441#L265-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 404#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 405#L55 assume 1 == ~p_dw_pc~0; 430#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 421#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 432#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 450#L305 assume !(0 != activate_threads_~tmp~1); 451#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 444#L74 assume !(1 == ~c_dr_pc~0); 415#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 416#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 446#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 455#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 456#L313-2 assume !(1 == ~q_read_ev~0); 434#L283-1 assume !(1 == ~q_write_ev~0); 372#L409-1 [2019-11-15 20:33:44,558 INFO L793 eck$LassoCheckResult]: Loop: 372#L409-1 assume !false; 373#L410 start_simulation_~kernel_st~0 := 1;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; 374#L354 assume !false; 375#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 422#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 423#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 449#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 435#L334 assume !(0 != eval_~tmp___1~0); 428#L370 start_simulation_~kernel_st~0 := 2; 381#L212-2 assume !(1 == ~q_req_up~0); 376#L212-3 start_simulation_~kernel_st~0 := 3; 377#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 437#L265-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 398#L270-3 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 389#L55-3 assume 1 == ~p_dw_pc~0; 390#L56-1 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 384#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 429#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 438#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 439#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 413#L74-3 assume !(1 == ~c_dr_pc~0); 410#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 411#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 418#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 457#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 442#L313-5 assume !(1 == ~q_read_ev~0); 443#L283-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 454#L288-3 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 391#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 392#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 448#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 417#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 400#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 401#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 427#L426 assume !(0 != start_simulation_~tmp~4); 372#L409-1 [2019-11-15 20:33:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash 434480677, now seen corresponding path program 1 times [2019-11-15 20:33:44,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:44,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274319866] [2019-11-15 20:33:44,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:44,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274319866] [2019-11-15 20:33:44,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:44,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:44,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113489384] [2019-11-15 20:33:44,610 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:33:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171118, now seen corresponding path program 2 times [2019-11-15 20:33:44,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:44,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308082468] [2019-11-15 20:33:44,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:44,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308082468] [2019-11-15 20:33:44,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:44,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:44,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510005730] [2019-11-15 20:33:44,667 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:44,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:33:44,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:33:44,670 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. cyclomatic complexity: 43 Second operand 3 states. [2019-11-15 20:33:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:44,781 INFO L93 Difference]: Finished difference Result 167 states and 243 transitions. [2019-11-15 20:33:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:33:44,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 243 transitions. [2019-11-15 20:33:44,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2019-11-15 20:33:44,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 243 transitions. [2019-11-15 20:33:44,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-11-15 20:33:44,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-11-15 20:33:44,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 243 transitions. [2019-11-15 20:33:44,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:44,797 INFO L688 BuchiCegarLoop]: Abstraction has 167 states and 243 transitions. [2019-11-15 20:33:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 243 transitions. [2019-11-15 20:33:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-11-15 20:33:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-15 20:33:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2019-11-15 20:33:44,825 INFO L711 BuchiCegarLoop]: Abstraction has 167 states and 243 transitions. [2019-11-15 20:33:44,826 INFO L591 BuchiCegarLoop]: Abstraction has 167 states and 243 transitions. [2019-11-15 20:33:44,826 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:33:44,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 243 transitions. [2019-11-15 20:33:44,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2019-11-15 20:33:44,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:44,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:44,832 INFO L849 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] [2019-11-15 20:33:44,834 INFO L850 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] [2019-11-15 20:33:44,835 INFO L791 eck$LassoCheckResult]: Stem: 688#ULTIMATE.startENTRY ~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; 656#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 657#L452 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; 653#L212 assume !(1 == ~q_req_up~0); 655#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 754#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 750#L232-1 assume !(0 == ~q_read_ev~0); 707#L265-1 assume !(0 == ~q_write_ev~0); 668#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 669#L55 assume 1 == ~p_dw_pc~0; 749#L56 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 746#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 726#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 727#L305 assume !(0 != activate_threads_~tmp~1); 728#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 729#L74 assume !(1 == ~c_dr_pc~0); 678#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 679#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 713#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 730#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 731#L313-2 assume !(1 == ~q_read_ev~0); 698#L283-1 assume !(1 == ~q_write_ev~0); 699#L409-1 [2019-11-15 20:33:44,835 INFO L793 eck$LassoCheckResult]: Loop: 699#L409-1 assume !false; 778#L410 start_simulation_~kernel_st~0 := 1;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; 772#L354 assume !false; 771#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 769#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 768#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 767#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 765#L334 assume !(0 != eval_~tmp___1~0); 763#L370 start_simulation_~kernel_st~0 := 2; 761#L212-2 assume !(1 == ~q_req_up~0); 759#L212-3 start_simulation_~kernel_st~0 := 3; 758#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 757#L265-4 assume !(0 == ~q_write_ev~0); 755#L270-3 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 753#L55-3 assume !(1 == ~p_dw_pc~0); 643#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 644#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 692#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 745#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 744#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 743#L74-3 assume !(1 == ~c_dr_pc~0); 735#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 752#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 751#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 732#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 708#L313-5 assume !(1 == ~q_read_ev~0); 709#L283-3 assume !(1 == ~q_write_ev~0); 725#L288-3 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 793#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 791#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 790#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 789#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 788#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 787#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 781#L426 assume !(0 != start_simulation_~tmp~4); 699#L409-1 [2019-11-15 20:33:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:44,836 INFO L82 PathProgramCache]: Analyzing trace with hash -845383001, now seen corresponding path program 1 times [2019-11-15 20:33:44,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:44,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371284404] [2019-11-15 20:33:44,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:44,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371284404] [2019-11-15 20:33:44,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:44,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:44,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975803746] [2019-11-15 20:33:44,902 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:33:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash -656697805, now seen corresponding path program 1 times [2019-11-15 20:33:44,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:44,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946315480] [2019-11-15 20:33:44,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:44,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:44,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946315480] [2019-11-15 20:33:44,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:44,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:44,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842099400] [2019-11-15 20:33:44,956 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:44,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:33:44,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:33:44,957 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. cyclomatic complexity: 77 Second operand 3 states. [2019-11-15 20:33:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:45,012 INFO L93 Difference]: Finished difference Result 281 states and 402 transitions. [2019-11-15 20:33:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:33:45,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 402 transitions. [2019-11-15 20:33:45,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 230 [2019-11-15 20:33:45,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 281 states and 402 transitions. [2019-11-15 20:33:45,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2019-11-15 20:33:45,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2019-11-15 20:33:45,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 402 transitions. [2019-11-15 20:33:45,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:45,030 INFO L688 BuchiCegarLoop]: Abstraction has 281 states and 402 transitions. [2019-11-15 20:33:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 402 transitions. [2019-11-15 20:33:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2019-11-15 20:33:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-15 20:33:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 394 transitions. [2019-11-15 20:33:45,064 INFO L711 BuchiCegarLoop]: Abstraction has 275 states and 394 transitions. [2019-11-15 20:33:45,065 INFO L591 BuchiCegarLoop]: Abstraction has 275 states and 394 transitions. [2019-11-15 20:33:45,065 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:33:45,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 275 states and 394 transitions. [2019-11-15 20:33:45,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 224 [2019-11-15 20:33:45,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:45,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:45,076 INFO L849 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] [2019-11-15 20:33:45,076 INFO L850 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] [2019-11-15 20:33:45,076 INFO L791 eck$LassoCheckResult]: Stem: 1142#ULTIMATE.startENTRY ~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; 1109#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 1110#L452 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; 1105#L212 assume !(1 == ~q_req_up~0); 1107#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1150#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1151#L232-1 assume !(0 == ~q_read_ev~0); 1164#L265-1 assume !(0 == ~q_write_ev~0); 1120#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1121#L55 assume !(1 == ~p_dw_pc~0); 1137#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 1138#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1186#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1187#L305 assume !(0 != activate_threads_~tmp~1); 1203#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1202#L74 assume !(1 == ~c_dr_pc~0); 1132#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 1133#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1171#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1194#L313 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1341#L313-2 assume !(1 == ~q_read_ev~0); 1155#L283-1 assume !(1 == ~q_write_ev~0); 1156#L409-1 [2019-11-15 20:33:45,076 INFO L793 eck$LassoCheckResult]: Loop: 1156#L409-1 assume !false; 1338#L410 start_simulation_~kernel_st~0 := 1;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; 1332#L354 assume !false; 1331#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1329#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1328#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1327#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 1325#L334 assume !(0 != eval_~tmp___1~0); 1324#L370 start_simulation_~kernel_st~0 := 2; 1098#L212-2 assume !(1 == ~q_req_up~0); 1091#L212-3 start_simulation_~kernel_st~0 := 3; 1092#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 1321#L265-4 assume !(0 == ~q_write_ev~0); 1113#L270-3 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1108#L55-3 assume !(1 == ~p_dw_pc~0); 1096#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 1097#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1145#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1157#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 1158#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1130#L74-3 assume !(1 == ~c_dr_pc~0); 1127#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 1128#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1135#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1191#L313-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 1166#L313-5 assume !(1 == ~q_read_ev~0); 1167#L283-3 assume !(1 == ~q_write_ev~0); 1185#L288-3 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1102#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1103#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1346#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1344#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 1343#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 1342#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1340#L426 assume !(0 != start_simulation_~tmp~4); 1156#L409-1 [2019-11-15 20:33:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2124707736, now seen corresponding path program 1 times [2019-11-15 20:33:45,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:45,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134121202] [2019-11-15 20:33:45,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:45,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134121202] [2019-11-15 20:33:45,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:45,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:33:45,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980032933] [2019-11-15 20:33:45,159 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:33:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:45,159 INFO L82 PathProgramCache]: Analyzing trace with hash -656697805, now seen corresponding path program 2 times [2019-11-15 20:33:45,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:45,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263282632] [2019-11-15 20:33:45,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:45,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263282632] [2019-11-15 20:33:45,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:45,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:45,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478356395] [2019-11-15 20:33:45,195 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:45,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:45,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:33:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:33:45,196 INFO L87 Difference]: Start difference. First operand 275 states and 394 transitions. cyclomatic complexity: 121 Second operand 5 states. [2019-11-15 20:33:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:45,310 INFO L93 Difference]: Finished difference Result 662 states and 954 transitions. [2019-11-15 20:33:45,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:33:45,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 954 transitions. [2019-11-15 20:33:45,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 596 [2019-11-15 20:33:45,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 662 states and 954 transitions. [2019-11-15 20:33:45,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2019-11-15 20:33:45,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2019-11-15 20:33:45,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 662 states and 954 transitions. [2019-11-15 20:33:45,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:45,336 INFO L688 BuchiCegarLoop]: Abstraction has 662 states and 954 transitions. [2019-11-15 20:33:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states and 954 transitions. [2019-11-15 20:33:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 284. [2019-11-15 20:33:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-15 20:33:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 400 transitions. [2019-11-15 20:33:45,365 INFO L711 BuchiCegarLoop]: Abstraction has 284 states and 400 transitions. [2019-11-15 20:33:45,365 INFO L591 BuchiCegarLoop]: Abstraction has 284 states and 400 transitions. [2019-11-15 20:33:45,365 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:33:45,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 400 transitions. [2019-11-15 20:33:45,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 230 [2019-11-15 20:33:45,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:45,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:45,376 INFO L849 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] [2019-11-15 20:33:45,376 INFO L850 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] [2019-11-15 20:33:45,378 INFO L791 eck$LassoCheckResult]: Stem: 2093#ULTIMATE.startENTRY ~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; 2060#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 2061#L452 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; 2052#L212 assume !(1 == ~q_req_up~0); 2054#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2099#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2100#L232-1 assume !(0 == ~q_read_ev~0); 2113#L265-1 assume !(0 == ~q_write_ev~0); 2117#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2158#L55 assume !(1 == ~p_dw_pc~0); 2157#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 2156#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2155#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2154#L305 assume !(0 != activate_threads_~tmp~1); 2153#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2152#L74 assume !(1 == ~c_dr_pc~0); 2083#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 2084#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2146#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2147#L313 assume !(0 != activate_threads_~tmp___0~1); 2220#L313-2 assume !(1 == ~q_read_ev~0); 2104#L283-1 assume !(1 == ~q_write_ev~0); 2105#L409-1 [2019-11-15 20:33:45,378 INFO L793 eck$LassoCheckResult]: Loop: 2105#L409-1 assume !false; 2210#L410 start_simulation_~kernel_st~0 := 1;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; 2198#L354 assume !false; 2196#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2193#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2190#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2188#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 2185#L334 assume !(0 != eval_~tmp___1~0); 2182#L370 start_simulation_~kernel_st~0 := 2; 2177#L212-2 assume !(1 == ~q_req_up~0); 2172#L212-3 start_simulation_~kernel_st~0 := 3; 2170#L265-2 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 2168#L265-4 assume !(0 == ~q_write_ev~0); 2064#L270-3 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2055#L55-3 assume !(1 == ~p_dw_pc~0); 2056#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 2272#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2271#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2270#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2269#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2268#L74-3 assume !(1 == ~c_dr_pc~0); 2266#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 2265#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2264#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2263#L313-3 assume !(0 != activate_threads_~tmp___0~1); 2262#L313-5 assume !(1 == ~q_read_ev~0); 2261#L283-3 assume !(1 == ~q_write_ev~0); 2231#L288-3 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2260#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2258#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2257#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2256#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 2255#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 2253#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2237#L426 assume !(0 != start_simulation_~tmp~4); 2105#L409-1 [2019-11-15 20:33:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 1 times [2019-11-15 20:33:45,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:45,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412495041] [2019-11-15 20:33:45,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:45,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:33:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash 44366773, now seen corresponding path program 1 times [2019-11-15 20:33:45,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:45,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247491174] [2019-11-15 20:33:45,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:45,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247491174] [2019-11-15 20:33:45,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:45,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:45,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566355532] [2019-11-15 20:33:45,493 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:45,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:33:45,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:33:45,494 INFO L87 Difference]: Start difference. First operand 284 states and 400 transitions. cyclomatic complexity: 118 Second operand 3 states. [2019-11-15 20:33:45,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:45,542 INFO L93 Difference]: Finished difference Result 385 states and 524 transitions. [2019-11-15 20:33:45,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:33:45,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 385 states and 524 transitions. [2019-11-15 20:33:45,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 298 [2019-11-15 20:33:45,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 385 states to 385 states and 524 transitions. [2019-11-15 20:33:45,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2019-11-15 20:33:45,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 385 [2019-11-15 20:33:45,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 524 transitions. [2019-11-15 20:33:45,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:45,555 INFO L688 BuchiCegarLoop]: Abstraction has 385 states and 524 transitions. [2019-11-15 20:33:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 524 transitions. [2019-11-15 20:33:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-11-15 20:33:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-11-15 20:33:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 524 transitions. [2019-11-15 20:33:45,565 INFO L711 BuchiCegarLoop]: Abstraction has 385 states and 524 transitions. [2019-11-15 20:33:45,565 INFO L591 BuchiCegarLoop]: Abstraction has 385 states and 524 transitions. [2019-11-15 20:33:45,565 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:33:45,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 385 states and 524 transitions. [2019-11-15 20:33:45,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 298 [2019-11-15 20:33:45,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:45,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:45,579 INFO L849 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] [2019-11-15 20:33:45,579 INFO L850 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] [2019-11-15 20:33:45,579 INFO L791 eck$LassoCheckResult]: Stem: 2768#ULTIMATE.startENTRY ~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; 2734#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 2735#L452 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; 2727#L212 assume !(1 == ~q_req_up~0); 2729#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2773#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2774#L232-1 assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; 2784#L265-1 assume !(0 == ~q_write_ev~0); 2971#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2970#L55 assume !(1 == ~p_dw_pc~0); 2969#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 2968#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2967#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2966#L305 assume !(0 != activate_threads_~tmp~1); 2965#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2964#L74 assume !(1 == ~c_dr_pc~0); 2962#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 2959#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2957#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2952#L313 assume !(0 != activate_threads_~tmp___0~1); 2937#L313-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2777#L283-1 assume !(1 == ~q_write_ev~0); 2712#L409-1 [2019-11-15 20:33:45,580 INFO L793 eck$LassoCheckResult]: Loop: 2712#L409-1 assume !false; 2713#L410 start_simulation_~kernel_st~0 := 1;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; 2714#L354 assume !false; 2715#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2765#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2766#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2796#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 2778#L334 assume !(0 != eval_~tmp___1~0); 2771#L370 start_simulation_~kernel_st~0 := 2; 2721#L212-2 assume !(1 == ~q_req_up~0); 2716#L212-3 start_simulation_~kernel_st~0 := 3; 2717#L265-2 assume !(0 == ~q_read_ev~0); 2786#L265-4 assume !(0 == ~q_write_ev~0); 3096#L270-3 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3095#L55-3 assume !(1 == ~p_dw_pc~0); 3094#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 3092#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2803#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2781#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2782#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2755#L74-3 assume !(1 == ~c_dr_pc~0); 2757#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 3087#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3086#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2864#L313-3 assume !(0 != activate_threads_~tmp___0~1); 2861#L313-5 assume !(1 == ~q_read_ev~0); 2789#L283-3 assume !(1 == ~q_write_ev~0); 2804#L288-3 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2731#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2732#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2794#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2760#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 2741#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 2742#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2770#L426 assume !(0 != start_simulation_~tmp~4); 2712#L409-1 [2019-11-15 20:33:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:45,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1103637522, now seen corresponding path program 1 times [2019-11-15 20:33:45,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:45,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290508150] [2019-11-15 20:33:45,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:45,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290508150] [2019-11-15 20:33:45,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:45,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:45,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019753238] [2019-11-15 20:33:45,615 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:33:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:45,615 INFO L82 PathProgramCache]: Analyzing trace with hash -89646733, now seen corresponding path program 1 times [2019-11-15 20:33:45,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:45,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441444410] [2019-11-15 20:33:45,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:45,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441444410] [2019-11-15 20:33:45,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:45,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:33:45,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053559896] [2019-11-15 20:33:45,659 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:45,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:33:45,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:33:45,660 INFO L87 Difference]: Start difference. First operand 385 states and 524 transitions. cyclomatic complexity: 141 Second operand 3 states. [2019-11-15 20:33:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:45,705 INFO L93 Difference]: Finished difference Result 662 states and 899 transitions. [2019-11-15 20:33:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:33:45,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 899 transitions. [2019-11-15 20:33:45,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 528 [2019-11-15 20:33:45,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 662 states and 899 transitions. [2019-11-15 20:33:45,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2019-11-15 20:33:45,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2019-11-15 20:33:45,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 662 states and 899 transitions. [2019-11-15 20:33:45,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:45,724 INFO L688 BuchiCegarLoop]: Abstraction has 662 states and 899 transitions. [2019-11-15 20:33:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states and 899 transitions. [2019-11-15 20:33:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2019-11-15 20:33:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-11-15 20:33:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 899 transitions. [2019-11-15 20:33:45,742 INFO L711 BuchiCegarLoop]: Abstraction has 662 states and 899 transitions. [2019-11-15 20:33:45,742 INFO L591 BuchiCegarLoop]: Abstraction has 662 states and 899 transitions. [2019-11-15 20:33:45,742 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:33:45,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 662 states and 899 transitions. [2019-11-15 20:33:45,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 528 [2019-11-15 20:33:45,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:45,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:45,749 INFO L849 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] [2019-11-15 20:33:45,749 INFO L850 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] [2019-11-15 20:33:45,750 INFO L791 eck$LassoCheckResult]: Stem: 3825#ULTIMATE.startENTRY ~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; 3791#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 3792#L452 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; 3783#L212 assume !(1 == ~q_req_up~0); 3785#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 3832#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 3833#L232-1 assume !(0 == ~q_read_ev~0); 3849#L265-1 assume !(0 == ~q_write_ev~0); 3851#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 3831#L55 assume !(1 == ~p_dw_pc~0); 3820#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 3821#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 3970#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 3969#L305 assume !(0 != activate_threads_~tmp~1); 3968#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 3967#L74 assume !(1 == ~c_dr_pc~0); 3940#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 3941#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 3932#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3933#L313 assume !(0 != activate_threads_~tmp___0~1); 4000#L313-2 assume !(1 == ~q_read_ev~0); 3837#L283-1 assume !(1 == ~q_write_ev~0); 3838#L409-1 [2019-11-15 20:33:45,751 INFO L793 eck$LassoCheckResult]: Loop: 3838#L409-1 assume !false; 3990#L410 start_simulation_~kernel_st~0 := 1;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; 3983#L354 assume !false; 3984#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3978#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 3979#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4052#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 4047#L334 assume !(0 != eval_~tmp___1~0); 4043#L370 start_simulation_~kernel_st~0 := 2; 4039#L212-2 assume !(1 == ~q_req_up~0); 4040#L212-3 start_simulation_~kernel_st~0 := 3; 4171#L265-2 assume !(0 == ~q_read_ev~0); 4168#L265-4 assume !(0 == ~q_write_ev~0); 4165#L270-3 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4156#L55-3 assume !(1 == ~p_dw_pc~0); 4154#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 4152#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4150#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 4148#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 4146#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4144#L74-3 assume !(1 == ~c_dr_pc~0); 4140#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 4138#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4136#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 4118#L313-3 assume !(0 != activate_threads_~tmp___0~1); 4113#L313-5 assume !(1 == ~q_read_ev~0); 4108#L283-3 assume !(1 == ~q_write_ev~0); 4104#L288-3 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4101#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4098#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4096#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 4094#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 4092#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 4090#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 4087#L426 assume !(0 != start_simulation_~tmp~4); 3838#L409-1 [2019-11-15 20:33:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 2 times [2019-11-15 20:33:45,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:45,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688976734] [2019-11-15 20:33:45,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:45,777 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:33:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:45,778 INFO L82 PathProgramCache]: Analyzing trace with hash -89646733, now seen corresponding path program 2 times [2019-11-15 20:33:45,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:45,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976033541] [2019-11-15 20:33:45,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:45,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976033541] [2019-11-15 20:33:45,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:45,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:33:45,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608835831] [2019-11-15 20:33:45,826 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:45,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:45,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:33:45,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:33:45,826 INFO L87 Difference]: Start difference. First operand 662 states and 899 transitions. cyclomatic complexity: 239 Second operand 5 states. [2019-11-15 20:33:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:45,931 INFO L93 Difference]: Finished difference Result 954 states and 1287 transitions. [2019-11-15 20:33:45,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:33:45,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 954 states and 1287 transitions. [2019-11-15 20:33:45,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 812 [2019-11-15 20:33:45,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 954 states to 954 states and 1287 transitions. [2019-11-15 20:33:45,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 954 [2019-11-15 20:33:45,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 954 [2019-11-15 20:33:45,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 954 states and 1287 transitions. [2019-11-15 20:33:45,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:45,955 INFO L688 BuchiCegarLoop]: Abstraction has 954 states and 1287 transitions. [2019-11-15 20:33:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states and 1287 transitions. [2019-11-15 20:33:45,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 686. [2019-11-15 20:33:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-15 20:33:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 923 transitions. [2019-11-15 20:33:45,975 INFO L711 BuchiCegarLoop]: Abstraction has 686 states and 923 transitions. [2019-11-15 20:33:45,975 INFO L591 BuchiCegarLoop]: Abstraction has 686 states and 923 transitions. [2019-11-15 20:33:45,975 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 20:33:45,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 686 states and 923 transitions. [2019-11-15 20:33:45,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 552 [2019-11-15 20:33:45,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:45,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:45,983 INFO L849 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] [2019-11-15 20:33:45,983 INFO L850 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] [2019-11-15 20:33:45,984 INFO L791 eck$LassoCheckResult]: Stem: 5459#ULTIMATE.startENTRY ~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; 5423#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 5424#L452 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; 5416#L212 assume !(1 == ~q_req_up~0); 5418#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5467#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5468#L232-1 assume !(0 == ~q_read_ev~0); 5599#L265-1 assume !(0 == ~q_write_ev~0); 5598#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5597#L55 assume !(1 == ~p_dw_pc~0); 5596#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 5595#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5594#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 5593#L305 assume !(0 != activate_threads_~tmp~1); 5592#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5591#L74 assume !(1 == ~c_dr_pc~0); 5586#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 5587#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5567#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5568#L313 assume !(0 != activate_threads_~tmp___0~1); 5511#L313-2 assume !(1 == ~q_read_ev~0); 5512#L283-1 assume !(1 == ~q_write_ev~0); 6035#L409-1 [2019-11-15 20:33:45,984 INFO L793 eck$LassoCheckResult]: Loop: 6035#L409-1 assume !false; 6033#L410 start_simulation_~kernel_st~0 := 1;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; 6026#L354 assume !false; 6004#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5987#L245 assume !(0 == ~p_dw_st~0); 5985#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 5984#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5849#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 5850#L334 assume !(0 != eval_~tmp___1~0); 5981#L370 start_simulation_~kernel_st~0 := 2; 5409#L212-2 assume !(1 == ~q_req_up~0); 5411#L212-3 start_simulation_~kernel_st~0 := 3; 5484#L265-2 assume !(0 == ~q_read_ev~0); 5485#L265-4 assume !(0 == ~q_write_ev~0); 6020#L270-3 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6019#L55-3 assume !(1 == ~p_dw_pc~0); 6018#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 6017#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6016#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6012#L305-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 6010#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6009#L74-3 assume !(1 == ~c_dr_pc~0); 5442#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 5443#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6006#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6005#L313-3 assume !(0 != activate_threads_~tmp___0~1); 5988#L313-5 assume !(1 == ~q_read_ev~0); 5489#L283-3 assume !(1 == ~q_write_ev~0); 6050#L288-3 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6049#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6047#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6046#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 6045#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 6044#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 6042#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 6039#L426 assume !(0 != start_simulation_~tmp~4); 6035#L409-1 [2019-11-15 20:33:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:45,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 3 times [2019-11-15 20:33:45,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:45,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466679357] [2019-11-15 20:33:45,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:45,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,018 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:33:46,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:46,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1115731674, now seen corresponding path program 1 times [2019-11-15 20:33:46,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:46,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292931370] [2019-11-15 20:33:46,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:46,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292931370] [2019-11-15 20:33:46,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:46,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:33:46,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202658638] [2019-11-15 20:33:46,103 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:46,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:46,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:33:46,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:33:46,104 INFO L87 Difference]: Start difference. First operand 686 states and 923 transitions. cyclomatic complexity: 239 Second operand 5 states. [2019-11-15 20:33:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:46,186 INFO L93 Difference]: Finished difference Result 950 states and 1267 transitions. [2019-11-15 20:33:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:33:46,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 950 states and 1267 transitions. [2019-11-15 20:33:46,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 816 [2019-11-15 20:33:46,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 950 states to 950 states and 1267 transitions. [2019-11-15 20:33:46,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 950 [2019-11-15 20:33:46,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 950 [2019-11-15 20:33:46,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 950 states and 1267 transitions. [2019-11-15 20:33:46,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:46,211 INFO L688 BuchiCegarLoop]: Abstraction has 950 states and 1267 transitions. [2019-11-15 20:33:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states and 1267 transitions. [2019-11-15 20:33:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 692. [2019-11-15 20:33:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-11-15 20:33:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 913 transitions. [2019-11-15 20:33:46,230 INFO L711 BuchiCegarLoop]: Abstraction has 692 states and 913 transitions. [2019-11-15 20:33:46,230 INFO L591 BuchiCegarLoop]: Abstraction has 692 states and 913 transitions. [2019-11-15 20:33:46,230 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 20:33:46,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 692 states and 913 transitions. [2019-11-15 20:33:46,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 558 [2019-11-15 20:33:46,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:46,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:46,237 INFO L849 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] [2019-11-15 20:33:46,237 INFO L850 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] [2019-11-15 20:33:46,238 INFO L791 eck$LassoCheckResult]: Stem: 7108#ULTIMATE.startENTRY ~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; 7073#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 7074#L452 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; 7070#L212 assume !(1 == ~q_req_up~0); 7072#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 7118#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 7119#L232-1 assume !(0 == ~q_read_ev~0); 7246#L265-1 assume !(0 == ~q_write_ev~0); 7245#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 7244#L55 assume !(1 == ~p_dw_pc~0); 7243#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 7242#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 7241#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 7240#L305 assume !(0 != activate_threads_~tmp~1); 7239#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 7238#L74 assume !(1 == ~c_dr_pc~0); 7235#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 7236#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 7230#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 7231#L313 assume !(0 != activate_threads_~tmp___0~1); 7160#L313-2 assume !(1 == ~q_read_ev~0); 7122#L283-1 assume !(1 == ~q_write_ev~0); 7123#L409-1 [2019-11-15 20:33:46,238 INFO L793 eck$LassoCheckResult]: Loop: 7123#L409-1 assume !false; 7458#L410 start_simulation_~kernel_st~0 := 1;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; 7445#L354 assume !false; 7442#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7439#L245 assume !(0 == ~p_dw_st~0); 7434#L249 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 7430#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7427#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 7423#L334 assume !(0 != eval_~tmp___1~0); 7419#L370 start_simulation_~kernel_st~0 := 2; 7414#L212-2 assume !(1 == ~q_req_up~0); 7415#L212-3 start_simulation_~kernel_st~0 := 3; 7594#L265-2 assume !(0 == ~q_read_ev~0); 7592#L265-4 assume !(0 == ~q_write_ev~0); 7590#L270-3 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 7588#L55-3 assume !(1 == ~p_dw_pc~0); 7585#L55-5 is_do_write_p_triggered_~__retres1~0 := 0; 7582#L66-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 7579#L67-1 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 7576#L305-3 assume !(0 != activate_threads_~tmp~1); 7571#L305-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 7568#L74-3 assume !(1 == ~c_dr_pc~0); 7564#L74-5 is_do_read_c_triggered_~__retres1~1 := 0; 7561#L85-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 7558#L86-1 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 7556#L313-3 assume !(0 != activate_threads_~tmp___0~1); 7553#L313-5 assume !(1 == ~q_read_ev~0); 7552#L283-3 assume !(1 == ~q_write_ev~0); 7490#L288-3 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7548#L245-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 7545#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7543#L258-1 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 7541#L384 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 7539#L391 stop_simulation_#res := stop_simulation_~__retres2~0; 7537#L392 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp~4 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 7536#L426 assume !(0 != start_simulation_~tmp~4); 7123#L409-1 [2019-11-15 20:33:46,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2124705814, now seen corresponding path program 4 times [2019-11-15 20:33:46,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:46,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426347772] [2019-11-15 20:33:46,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,267 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:33:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:46,269 INFO L82 PathProgramCache]: Analyzing trace with hash -472616228, now seen corresponding path program 1 times [2019-11-15 20:33:46,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:46,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037799858] [2019-11-15 20:33:46,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:46,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037799858] [2019-11-15 20:33:46,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:46,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:33:46,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711885020] [2019-11-15 20:33:46,298 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:33:46,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:46,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:33:46,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:33:46,299 INFO L87 Difference]: Start difference. First operand 692 states and 913 transitions. cyclomatic complexity: 223 Second operand 3 states. [2019-11-15 20:33:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:46,333 INFO L93 Difference]: Finished difference Result 837 states and 1079 transitions. [2019-11-15 20:33:46,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:33:46,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 837 states and 1079 transitions. [2019-11-15 20:33:46,343 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 695 [2019-11-15 20:33:46,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 837 states to 837 states and 1079 transitions. [2019-11-15 20:33:46,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 837 [2019-11-15 20:33:46,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 837 [2019-11-15 20:33:46,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 837 states and 1079 transitions. [2019-11-15 20:33:46,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:46,355 INFO L688 BuchiCegarLoop]: Abstraction has 837 states and 1079 transitions. [2019-11-15 20:33:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states and 1079 transitions. [2019-11-15 20:33:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2019-11-15 20:33:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-11-15 20:33:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1079 transitions. [2019-11-15 20:33:46,400 INFO L711 BuchiCegarLoop]: Abstraction has 837 states and 1079 transitions. [2019-11-15 20:33:46,400 INFO L591 BuchiCegarLoop]: Abstraction has 837 states and 1079 transitions. [2019-11-15 20:33:46,400 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 20:33:46,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 837 states and 1079 transitions. [2019-11-15 20:33:46,406 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 695 [2019-11-15 20:33:46,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:46,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:46,410 INFO L849 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] [2019-11-15 20:33:46,410 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:46,411 INFO L791 eck$LassoCheckResult]: Stem: 8640#ULTIMATE.startENTRY ~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; 8605#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 8606#L452 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; 8602#L212 assume !(1 == ~q_req_up~0); 8604#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 8646#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 8647#L232-1 assume !(0 == ~q_read_ev~0); 8665#L265-1 assume !(0 == ~q_write_ev~0); 8619#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 8620#L55 assume !(1 == ~p_dw_pc~0); 8638#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 8639#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 8648#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 8684#L305 assume !(0 != activate_threads_~tmp~1); 9208#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 9187#L74 assume !(1 == ~c_dr_pc~0); 9183#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 9181#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 9179#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 9172#L313 assume !(0 != activate_threads_~tmp___0~1); 9169#L313-2 assume !(1 == ~q_read_ev~0); 8655#L283-1 assume !(1 == ~q_write_ev~0); 8656#L409-1 assume !false; 9385#L410 start_simulation_~kernel_st~0 := 1;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; 9380#L354 [2019-11-15 20:33:46,411 INFO L793 eck$LassoCheckResult]: Loop: 9380#L354 assume !false; 9378#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9263#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 9262#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9217#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 9216#L334 assume 0 != eval_~tmp___1~0; 9214#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 8590#L343 assume !(0 != eval_~tmp~2); 8591#L339 assume !(0 == ~c_dr_st~0); 9380#L354 [2019-11-15 20:33:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1732817812, now seen corresponding path program 1 times [2019-11-15 20:33:46,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:46,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839539004] [2019-11-15 20:33:46,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,428 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:33:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash -446247985, now seen corresponding path program 1 times [2019-11-15 20:33:46,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:46,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992312001] [2019-11-15 20:33:46,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,437 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:33:46,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash 316098500, now seen corresponding path program 1 times [2019-11-15 20:33:46,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:46,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412990640] [2019-11-15 20:33:46,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:33:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:33:46,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412990640] [2019-11-15 20:33:46,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:33:46,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:33:46,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222641187] [2019-11-15 20:33:46,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:33:46,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:33:46,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:33:46,548 INFO L87 Difference]: Start difference. First operand 837 states and 1079 transitions. cyclomatic complexity: 250 Second operand 3 states. [2019-11-15 20:33:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:33:46,578 INFO L93 Difference]: Finished difference Result 1083 states and 1374 transitions. [2019-11-15 20:33:46,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:33:46,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1083 states and 1374 transitions. [2019-11-15 20:33:46,588 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 933 [2019-11-15 20:33:46,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1083 states to 1083 states and 1374 transitions. [2019-11-15 20:33:46,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1083 [2019-11-15 20:33:46,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1083 [2019-11-15 20:33:46,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1083 states and 1374 transitions. [2019-11-15 20:33:46,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:33:46,601 INFO L688 BuchiCegarLoop]: Abstraction has 1083 states and 1374 transitions. [2019-11-15 20:33:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states and 1374 transitions. [2019-11-15 20:33:46,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2019-11-15 20:33:46,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-11-15 20:33:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1374 transitions. [2019-11-15 20:33:46,621 INFO L711 BuchiCegarLoop]: Abstraction has 1083 states and 1374 transitions. [2019-11-15 20:33:46,621 INFO L591 BuchiCegarLoop]: Abstraction has 1083 states and 1374 transitions. [2019-11-15 20:33:46,621 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 20:33:46,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1083 states and 1374 transitions. [2019-11-15 20:33:46,628 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 933 [2019-11-15 20:33:46,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:33:46,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:33:46,629 INFO L849 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] [2019-11-15 20:33:46,629 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:33:46,630 INFO L791 eck$LassoCheckResult]: Stem: 10571#ULTIMATE.startENTRY ~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; 10532#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~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; 10533#L452 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; 10529#L212 assume !(1 == ~q_req_up~0); 10525#L212-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 10526#L227-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 10594#L232-1 assume !(0 == ~q_read_ev~0); 10595#L265-1 assume !(0 == ~q_write_ev~0); 10598#L270-1 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;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 10577#L55 assume !(1 == ~p_dw_pc~0); 10569#L55-2 is_do_write_p_triggered_~__retres1~0 := 0; 10570#L66 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10616#L67 activate_threads_#t~ret3 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10613#L305 assume !(0 != activate_threads_~tmp~1); 10614#L305-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 10601#L74 assume !(1 == ~c_dr_pc~0); 10602#L74-2 is_do_read_c_triggered_~__retres1~1 := 0; 11240#L85 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 11238#L86 activate_threads_#t~ret4 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10617#L313 assume !(0 != activate_threads_~tmp___0~1); 10618#L313-2 assume !(1 == ~q_read_ev~0); 10585#L283-1 assume !(1 == ~q_write_ev~0); 10586#L409-1 assume !false; 11243#L410 start_simulation_~kernel_st~0 := 1;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; 11232#L354 [2019-11-15 20:33:46,630 INFO L793 eck$LassoCheckResult]: Loop: 11232#L354 assume !false; 11242#L330 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11241#L245 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 11239#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11237#L258 eval_#t~ret5 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret5;havoc eval_#t~ret5; 11236#L334 assume 0 != eval_~tmp___1~0; 11235#L334-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet6;havoc eval_#t~nondet6; 11234#L343 assume !(0 != eval_~tmp~2); 11233#L339 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet7;havoc eval_#t~nondet7; 11221#L358 assume !(0 != eval_~tmp___0~2); 11232#L354 [2019-11-15 20:33:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1732817812, now seen corresponding path program 2 times [2019-11-15 20:33:46,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:46,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8288625] [2019-11-15 20:33:46,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,643 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:33:46,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:46,644 INFO L82 PathProgramCache]: Analyzing trace with hash -948787220, now seen corresponding path program 1 times [2019-11-15 20:33:46,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:46,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83237848] [2019-11-15 20:33:46,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,652 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:33:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:33:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1209117335, now seen corresponding path program 1 times [2019-11-15 20:33:46,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:33:46,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792328046] [2019-11-15 20:33:46,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:33:46,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:33:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:33:46,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:33:47,088 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-11-15 20:33:47,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:33:47 BoogieIcfgContainer [2019-11-15 20:33:47,247 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:33:47,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:33:47,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:33:47,248 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:33:47,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:33:43" (3/4) ... [2019-11-15 20:33:47,252 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 20:33:47,389 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c1331195-ae01-4404-b887-27918e79acdd/bin/uautomizer/witness.graphml [2019-11-15 20:33:47,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:33:47,391 INFO L168 Benchmark]: Toolchain (without parser) took 4917.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 942.4 MB in the beginning and 1.0 GB in the end (delta: -61.5 MB). Peak memory consumption was 74.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:47,391 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:33:47,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:47,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:47,393 INFO L168 Benchmark]: Boogie Preprocessor took 69.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:33:47,393 INFO L168 Benchmark]: RCFGBuilder took 608.56 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:47,394 INFO L168 Benchmark]: BuchiAutomizer took 3340.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:47,394 INFO L168 Benchmark]: Witness Printer took 141.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:47,396 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 672.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 608.56 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3340.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 11.5 GB. * Witness Printer took 141.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1083 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 910 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1083 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1379 SDtfs, 1517 SDslu, 1761 SDs, 0 SdLazy, 161 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI6 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 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@5ff11517=0, c_dr_pc=0, a_t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c859e91=0, \result=0, \result=0, c_num_read=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d406fa1=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@36045fbe=0, q_free=1, __retres1=0, p_dw_st=0, \result=0, q_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46dbcfec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d833297=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 ; [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] c_dr_i = 1 [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 [L212] COND FALSE !((int )q_req_up == 1) [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 [L265] COND FALSE !((int )q_read_ev == 0) [L270] COND FALSE !((int )q_write_ev == 0) [L298] int tmp ; [L299] int tmp___0 ; [L52] int __retres1 ; [L55] COND FALSE !((int )p_dw_pc == 1) [L65] __retres1 = 0 [L67] return (__retres1); [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) [L71] int __retres1 ; [L74] COND FALSE !((int )c_dr_pc == 1) [L84] __retres1 = 0 [L86] return (__retres1); [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) [L283] COND FALSE !((int )q_read_ev == 1) [L288] COND FALSE !((int )q_write_ev == 1) [L409] COND TRUE 1 [L412] kernel_st = 1 [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; Loop: [L329] COND TRUE 1 [L242] int __retres1 ; [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 [L258] return (__retres1); [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...