./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi008.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/mutex-meet-ghost/rfi008.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008.opt.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-ghost/rfi008.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-22 22:58:41,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-22 22:58:41,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-22 22:58:41,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-22 22:58:41,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-22 22:58:41,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-22 22:58:41,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-22 22:58:41,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-22 22:58:41,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-22 22:58:41,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-22 22:58:41,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-22 22:58:41,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-22 22:58:41,162 INFO L153 SettingsManager]: * Use SBE=true [2024-09-22 22:58:41,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-22 22:58:41,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-22 22:58:41,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-22 22:58:41,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-22 22:58:41,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-22 22:58:41,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-22 22:58:41,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-22 22:58:41,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-22 22:58:41,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-22 22:58:41,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-22 22:58:41,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-22 22:58:41,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-22 22:58:41,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-22 22:58:41,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-22 22:58:41,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-22 22:58:41,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-22 22:58:41,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-22 22:58:41,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 22:58:41,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-22 22:58:41,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-22 22:58:41,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-22 22:58:41,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-22 22:58:41,171 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-22 22:58:41,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-22 22:58:41,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-22 22:58:41,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-22 22:58:41,172 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-22 22:58:41,172 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-22 22:58:41,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-22 22:58:41,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-22 22:58:41,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-22 22:58:41,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-22 22:58:41,465 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-22 22:58:41,466 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-22 22:58:41,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/mutex-meet-ghost/rfi008.opt.yml/witness.yml [2024-09-22 22:58:41,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-22 22:58:41,561 INFO L274 PluginConnector]: CDTParser initialized [2024-09-22 22:58:41,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.opt.i [2024-09-22 22:58:42,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-22 22:58:43,243 INFO L384 CDTParser]: Found 1 translation units. [2024-09-22 22:58:43,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.opt.i [2024-09-22 22:58:43,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7c46882d1/f19dabe516e045d9a97acb9500898f37/FLAGbab5aa821 [2024-09-22 22:58:43,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7c46882d1/f19dabe516e045d9a97acb9500898f37 [2024-09-22 22:58:43,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-22 22:58:43,277 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-22 22:58:43,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-22 22:58:43,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-22 22:58:43,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-22 22:58:43,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.09 10:58:41" (1/2) ... [2024-09-22 22:58:43,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ab6f69 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.09 10:58:43, skipping insertion in model container [2024-09-22 22:58:43,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.09 10:58:41" (1/2) ... [2024-09-22 22:58:43,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@771b4d5e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.09 10:58:43, skipping insertion in model container [2024-09-22 22:58:43,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 10:58:43" (2/2) ... [2024-09-22 22:58:43,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ab6f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:43, skipping insertion in model container [2024-09-22 22:58:43,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 10:58:43" (2/2) ... [2024-09-22 22:58:43,375 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-22 22:58:43,375 INFO L1541 ArrayList]: Location invariant before [L830-L830] (((((((((((((((((! multithreaded || y$r_buff0_thd0 == (_Bool)0) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )x) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL) && (long long )x - (long long )y$w_buff1_used >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y - (long long )y$w_buff1_used >= 0LL) && (long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL) && (long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0) [2024-09-22 22:58:43,376 INFO L1541 ArrayList]: Location invariant before [L829-L829] (((((((((((((((((! multithreaded || y$r_buff0_thd0 == (_Bool)0) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL) && (0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )x) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL) && (long long )x - (long long )y$w_buff1_used >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y - (long long )y$w_buff1_used >= 0LL) && (long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL) && (long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0) [2024-09-22 22:58:43,376 INFO L1541 ArrayList]: ghost_variable multithreaded = 0 [2024-09-22 22:58:43,376 INFO L1541 ArrayList]: ghost_update [L827-L827] multithreaded = 1; [2024-09-22 22:58:43,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-22 22:58:43,607 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.opt.i[987,1000] [2024-09-22 22:58:43,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 22:58:43,802 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-22 22:58:43,831 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.opt.i[987,1000] Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-22 22:58:44,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 22:58:44,106 INFO L204 MainTranslator]: Completed translation [2024-09-22 22:58:44,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44 WrapperNode [2024-09-22 22:58:44,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-22 22:58:44,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-22 22:58:44,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-22 22:58:44,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-22 22:58:44,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,191 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-09-22 22:58:44,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-22 22:58:44,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-22 22:58:44,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-22 22:58:44,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-22 22:58:44,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-22 22:58:44,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-22 22:58:44,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-22 22:58:44,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-22 22:58:44,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (1/1) ... [2024-09-22 22:58:44,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 22:58:44,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 22:58:44,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-22 22:58:44,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-22 22:58:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-22 22:58:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-22 22:58:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-22 22:58:44,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-22 22:58:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-22 22:58:44,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-22 22:58:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-22 22:58:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-22 22:58:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-22 22:58:44,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-22 22:58:44,354 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-22 22:58:44,478 INFO L242 CfgBuilder]: Building ICFG [2024-09-22 22:58:44,479 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-22 22:58:44,984 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-22 22:58:44,985 INFO L291 CfgBuilder]: Performing block encoding [2024-09-22 22:58:45,185 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-22 22:58:45,185 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-22 22:58:45,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 10:58:45 BoogieIcfgContainer [2024-09-22 22:58:45,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-22 22:58:45,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-22 22:58:45,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-22 22:58:45,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-22 22:58:45,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.09 10:58:41" (1/4) ... [2024-09-22 22:58:45,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4631cdbe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 22.09 10:58:45, skipping insertion in model container [2024-09-22 22:58:45,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 10:58:43" (2/4) ... [2024-09-22 22:58:45,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4631cdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 10:58:45, skipping insertion in model container [2024-09-22 22:58:45,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:58:44" (3/4) ... [2024-09-22 22:58:45,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4631cdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 10:58:45, skipping insertion in model container [2024-09-22 22:58:45,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 10:58:45" (4/4) ... [2024-09-22 22:58:45,196 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2024-09-22 22:58:45,213 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-22 22:58:45,213 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-22 22:58:45,213 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-22 22:58:45,271 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-22 22:58:45,316 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 22:58:45,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 22:58:45,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 22:58:45,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 22:58:45,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-22 22:58:45,353 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 22:58:45,365 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-09-22 22:58:45,375 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42bf08a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 22:58:45,375 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 22:58:45,643 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 22:58:45,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 22:58:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2091682803, now seen corresponding path program 1 times [2024-09-22 22:58:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 22:58:45,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682687026] [2024-09-22 22:58:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 22:58:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 22:58:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 22:58:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 22:58:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 22:58:46,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682687026] [2024-09-22 22:58:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682687026] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 22:58:46,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 22:58:46,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-22 22:58:46,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942849482] [2024-09-22 22:58:46,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 22:58:46,324 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-22 22:58:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 22:58:46,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-22 22:58:46,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-22 22:58:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:58:46,348 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 22:58:46,349 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 22:58:46,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:58:48,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-22 22:58:48,018 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-22 22:58:48,019 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-22 22:58:48,026 INFO L408 BasicCegarLoop]: Path program histogram: [1] [2024-09-22 22:58:48,029 INFO L312 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2) [2024-09-22 22:58:48,034 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 22:58:48,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 22:58:48,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 22:58:48,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 22:58:48,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-09-22 22:58:48,043 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 22:58:48,046 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 22:58:48,047 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42bf08a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 22:58:48,047 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-22 22:58:48,143 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-22 22:58:48,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 22:58:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash 351232952, now seen corresponding path program 1 times [2024-09-22 22:58:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 22:58:48,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071628717] [2024-09-22 22:58:48,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 22:58:48,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 22:58:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 22:58:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 22:58:49,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 22:58:49,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071628717] [2024-09-22 22:58:49,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071628717] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 22:58:49,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 22:58:49,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-22 22:58:49,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067118027] [2024-09-22 22:58:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 22:58:49,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 22:58:49,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 22:58:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 22:58:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 22:58:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:58:49,686 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 22:58:49,686 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 22:58:49,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:58:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:58:49,992 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-22 22:58:49,992 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-22 22:58:49,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 22:58:49,993 INFO L85 PathProgramCache]: Analyzing trace with hash 498247577, now seen corresponding path program 1 times [2024-09-22 22:58:49,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 22:58:49,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511224073] [2024-09-22 22:58:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 22:58:49,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 22:58:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 22:58:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 22:58:57,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 22:58:57,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511224073] [2024-09-22 22:58:57,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511224073] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 22:58:57,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 22:58:57,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-22 22:58:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549989132] [2024-09-22 22:58:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 22:58:57,996 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-22 22:58:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 22:58:57,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-22 22:58:57,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-22 22:58:57,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:58:57,998 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 22:58:57,998 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 22:58:57,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:58:57,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:58:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:58:58,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 22:58:58,393 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-22 22:58:58,394 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-22 22:58:58,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 22:58:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2127543808, now seen corresponding path program 1 times [2024-09-22 22:58:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 22:58:58,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074317888] [2024-09-22 22:58:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 22:58:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 22:58:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 22:58:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 22:58:58,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 22:58:58,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074317888] [2024-09-22 22:58:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074317888] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 22:58:58,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 22:58:58,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-22 22:58:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233644090] [2024-09-22 22:58:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 22:58:58,700 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-22 22:58:58,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 22:58:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-22 22:58:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-22 22:58:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:58:58,701 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 22:58:58,701 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 22:58:58,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:58:58,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 22:58:58,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:58:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:58:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 22:58:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 22:58:58,905 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-22 22:58:58,906 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-22 22:58:58,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 22:58:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash -488261475, now seen corresponding path program 1 times [2024-09-22 22:58:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 22:58:58,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977307591] [2024-09-22 22:58:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 22:58:58,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 22:58:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 22:59:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 22:59:00,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 22:59:00,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977307591] [2024-09-22 22:59:00,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977307591] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 22:59:00,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 22:59:00,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-22 22:59:00,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044195353] [2024-09-22 22:59:00,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 22:59:00,902 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-22 22:59:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 22:59:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-22 22:59:00,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-22 22:59:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:59:00,904 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 22:59:00,904 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 22:59:00,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:59:00,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 22:59:00,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 22:59:00,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:59:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:59:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 22:59:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 22:59:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-22 22:59:01,660 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-22 22:59:01,660 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-22 22:59:01,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 22:59:01,660 INFO L85 PathProgramCache]: Analyzing trace with hash 826420321, now seen corresponding path program 2 times [2024-09-22 22:59:01,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 22:59:01,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498893218] [2024-09-22 22:59:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 22:59:01,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 22:59:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 22:59:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 22:59:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 22:59:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498893218] [2024-09-22 22:59:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498893218] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 22:59:03,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 22:59:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-22 22:59:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645537819] [2024-09-22 22:59:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 22:59:03,778 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-22 22:59:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 22:59:03,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-22 22:59:03,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-22 22:59:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:59:03,779 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 22:59:03,780 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 22:59:03,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:59:03,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 22:59:03,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 22:59:03,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-22 22:59:03,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:59:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:59:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 22:59:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 22:59:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-22 22:59:04,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-22 22:59:04,680 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-22 22:59:04,680 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-22 22:59:04,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 22:59:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash 98772438, now seen corresponding path program 1 times [2024-09-22 22:59:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 22:59:04,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694850500] [2024-09-22 22:59:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 22:59:04,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 22:59:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 22:59:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 22:59:08,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 22:59:08,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694850500] [2024-09-22 22:59:08,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694850500] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 22:59:08,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 22:59:08,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-22 22:59:08,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984116019] [2024-09-22 22:59:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 22:59:08,877 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-22 22:59:08,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 22:59:08,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-22 22:59:08,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-22 22:59:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:59:08,879 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 22:59:08,879 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 22:59:08,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:59:08,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-22 22:59:08,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-22 22:59:08,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-22 22:59:08,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-22 22:59:08,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 22:59:09,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 22:59:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 22:59:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-22 22:59:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-22 22:59:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-22 22:59:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 22:59:09,246 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-22 22:59:09,247 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-22 22:59:09,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 22:59:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1467586097, now seen corresponding path program 3 times [2024-09-22 22:59:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 22:59:09,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940153233] [2024-09-22 22:59:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 22:59:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 22:59:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 22:59:09,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-22 22:59:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 22:59:09,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-22 22:59:09,417 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-22 22:59:09,417 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-09-22 22:59:09,417 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-09-22 22:59:09,417 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-09-22 22:59:09,418 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-09-22 22:59:09,418 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-09-22 22:59:09,418 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-22 22:59:09,419 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-09-22 22:59:09,420 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-09-22 22:59:09,505 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-22 22:59:09,505 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-22 22:59:09,508 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-22 22:59:09,508 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-22 22:59:09,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 10:59:09 BasicIcfg [2024-09-22 22:59:09,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-22 22:59:09,509 INFO L158 Benchmark]: Toolchain (without parser) took 26231.65ms. Allocated memory was 153.1MB in the beginning and 899.7MB in the end (delta: 746.6MB). Free memory was 105.4MB in the beginning and 384.8MB in the end (delta: -279.3MB). Peak memory consumption was 467.3MB. Max. memory is 16.1GB. [2024-09-22 22:59:09,509 INFO L158 Benchmark]: Witness Parser took 0.52ms. Allocated memory is still 109.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-22 22:59:09,509 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-22 22:59:09,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 829.18ms. Allocated memory is still 153.1MB. Free memory was 105.4MB in the beginning and 115.1MB in the end (delta: -9.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-09-22 22:59:09,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.39ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 108.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-22 22:59:09,510 INFO L158 Benchmark]: Boogie Preprocessor took 77.62ms. Allocated memory is still 153.1MB. Free memory was 108.8MB in the beginning and 105.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-22 22:59:09,510 INFO L158 Benchmark]: RCFGBuilder took 915.90ms. Allocated memory is still 153.1MB. Free memory was 105.8MB in the beginning and 82.5MB in the end (delta: 23.3MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2024-09-22 22:59:09,511 INFO L158 Benchmark]: TraceAbstraction took 24321.11ms. Allocated memory was 153.1MB in the beginning and 899.7MB in the end (delta: 746.6MB). Free memory was 82.5MB in the beginning and 384.8MB in the end (delta: -302.3MB). Peak memory consumption was 445.0MB. Max. memory is 16.1GB. [2024-09-22 22:59:09,512 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.52ms. Allocated memory is still 109.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 829.18ms. Allocated memory is still 153.1MB. Free memory was 105.4MB in the beginning and 115.1MB in the end (delta: -9.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.39ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 108.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.62ms. Allocated memory is still 153.1MB. Free memory was 108.8MB in the beginning and 105.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 915.90ms. Allocated memory is still 153.1MB. Free memory was 105.8MB in the beginning and 82.5MB in the end (delta: 23.3MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24321.11ms. Allocated memory was 153.1MB in the beginning and 899.7MB in the end (delta: 746.6MB). Free memory was 82.5MB in the beginning and 384.8MB in the end (delta: -302.3MB). Peak memory consumption was 445.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 939, independent: 836, independent conditional: 423, independent unconditional: 413, dependent: 103, dependent conditional: 68, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 923, independent: 836, independent conditional: 423, independent unconditional: 413, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 923, independent: 836, independent conditional: 423, independent unconditional: 413, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1014, independent: 836, independent conditional: 423, independent unconditional: 413, dependent: 178, dependent conditional: 143, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1014, independent: 836, independent conditional: 39, independent unconditional: 797, dependent: 178, dependent conditional: 49, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1014, independent: 836, independent conditional: 39, independent unconditional: 797, dependent: 178, dependent conditional: 49, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 468, independent: 417, independent conditional: 3, independent unconditional: 414, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 468, independent: 402, independent conditional: 0, independent unconditional: 402, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1713, independent: 412, independent conditional: 59, independent unconditional: 353, dependent: 1301, dependent conditional: 422, dependent unconditional: 879, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1014, independent: 419, independent conditional: 36, independent unconditional: 383, dependent: 127, dependent conditional: 36, dependent unconditional: 91, unknown: 468, unknown conditional: 16, unknown unconditional: 452] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 417, Positive conditional cache size: 3, Positive unconditional cache size: 414, Negative cache size: 51, Negative conditional cache size: 13, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 478, Maximal queried relation: 1, Independence queries for same thread: 16, Persistent sets #1 benchmarks: Persistent set computation time: 1.2s, Number of persistent set computation: 100, Number of trivial persistent sets: 65, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 448, independent: 413, independent conditional: 0, independent unconditional: 413, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 939, independent: 836, independent conditional: 423, independent unconditional: 413, dependent: 103, dependent conditional: 68, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 923, independent: 836, independent conditional: 423, independent unconditional: 413, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 923, independent: 836, independent conditional: 423, independent unconditional: 413, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1014, independent: 836, independent conditional: 423, independent unconditional: 413, dependent: 178, dependent conditional: 143, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1014, independent: 836, independent conditional: 39, independent unconditional: 797, dependent: 178, dependent conditional: 49, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1014, independent: 836, independent conditional: 39, independent unconditional: 797, dependent: 178, dependent conditional: 49, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 468, independent: 417, independent conditional: 3, independent unconditional: 414, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 468, independent: 402, independent conditional: 0, independent unconditional: 402, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1713, independent: 412, independent conditional: 59, independent unconditional: 353, dependent: 1301, dependent conditional: 422, dependent unconditional: 879, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1014, independent: 419, independent conditional: 36, independent unconditional: 383, dependent: 127, dependent conditional: 36, dependent unconditional: 91, unknown: 468, unknown conditional: 16, unknown unconditional: 452] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 417, Positive conditional cache size: 3, Positive unconditional cache size: 414, Negative cache size: 51, Negative conditional cache size: 13, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 478, Maximal queried relation: 1, Independence queries for same thread: 16 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1053, independent: 945, independent conditional: 623, independent unconditional: 322, dependent: 108, dependent conditional: 76, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1010, independent: 945, independent conditional: 623, independent unconditional: 322, dependent: 65, dependent conditional: 33, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1010, independent: 945, independent conditional: 623, independent unconditional: 322, dependent: 65, dependent conditional: 33, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1155, independent: 945, independent conditional: 623, independent unconditional: 322, dependent: 210, dependent conditional: 178, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1155, independent: 945, independent conditional: 20, independent unconditional: 925, dependent: 210, dependent conditional: 90, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1155, independent: 945, independent conditional: 20, independent unconditional: 925, dependent: 210, dependent conditional: 90, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 383, independent: 330, independent conditional: 6, independent unconditional: 324, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 383, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 72, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1333, independent: 286, independent conditional: 42, independent unconditional: 244, dependent: 1047, dependent conditional: 458, dependent unconditional: 589, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1155, independent: 615, independent conditional: 14, independent unconditional: 601, dependent: 157, dependent conditional: 69, dependent unconditional: 88, unknown: 383, unknown conditional: 27, unknown unconditional: 356] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 330, Positive conditional cache size: 6, Positive unconditional cache size: 324, Negative cache size: 53, Negative conditional cache size: 21, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 691, Maximal queried relation: 4, Independence queries for same thread: 43, Persistent sets #1 benchmarks: Persistent set computation time: 0.8s, Number of persistent set computation: 93, Number of trivial persistent sets: 56, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 322, independent conditional: 0, independent unconditional: 322, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1053, independent: 945, independent conditional: 623, independent unconditional: 322, dependent: 108, dependent conditional: 76, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1010, independent: 945, independent conditional: 623, independent unconditional: 322, dependent: 65, dependent conditional: 33, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1010, independent: 945, independent conditional: 623, independent unconditional: 322, dependent: 65, dependent conditional: 33, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1155, independent: 945, independent conditional: 623, independent unconditional: 322, dependent: 210, dependent conditional: 178, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1155, independent: 945, independent conditional: 20, independent unconditional: 925, dependent: 210, dependent conditional: 90, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1155, independent: 945, independent conditional: 20, independent unconditional: 925, dependent: 210, dependent conditional: 90, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 383, independent: 330, independent conditional: 6, independent unconditional: 324, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 383, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 72, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 53, dependent conditional: 21, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1333, independent: 286, independent conditional: 42, independent unconditional: 244, dependent: 1047, dependent conditional: 458, dependent unconditional: 589, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1155, independent: 615, independent conditional: 14, independent unconditional: 601, dependent: 157, dependent conditional: 69, dependent unconditional: 88, unknown: 383, unknown conditional: 27, unknown unconditional: 356] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 330, Positive conditional cache size: 6, Positive unconditional cache size: 324, Negative cache size: 53, Negative conditional cache size: 21, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 691, Maximal queried relation: 4, Independence queries for same thread: 43 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L1] 0 //@ ghost int multithreaded = 0; [L826] 0 pthread_t t1723; [L827] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1723=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L827] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1723=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L828] 0 pthread_t t1724; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1723=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L829] 0 //@ assert ((((((((((((((((((!multithreaded || (y$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) y) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL)) && (((0LL - (long long) y) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$mem_tmp) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice2) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EBX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) x) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice0) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EBX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (((((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed_var == 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1723=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L829] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1723=0, t1724=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L801] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L830] 0 //@ assert ((((((((((((((((((!multithreaded || (y$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) y) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EBX) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) x) >= 0LL)) && (((0LL - (long long) y) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$mem_tmp) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) + (long long) weak$$choice2) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EBX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EBX) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) __unbuffered_p0_EAX) - (long long) __unbuffered_p1_EBX) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) x) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice0) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EBX) - (long long) weak$$choice2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p0_EBX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (((((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed_var == 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1723=0, t1724=1, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723=0, t1724=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723=0, t1724=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723=0, t1724=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 829]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 57 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 92 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 57 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 3.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 3338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-09-22 22:59:09,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-09-22 22:59:09,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-09-22 22:59:09,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE