./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe018_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe018_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 00:26:37,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:26:37,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:26:37,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:26:37,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:26:37,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:26:37,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:26:37,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:26:37,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:26:37,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:26:37,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:26:37,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:26:37,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:26:37,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:26:37,928 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:26:37,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:26:37,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:26:37,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:26:37,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:26:37,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:26:37,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:26:37,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:26:37,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:26:37,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:26:37,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:26:37,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:26:37,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:26:37,935 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:26:37,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:26:37,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:26:37,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:26:37,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:26:37,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:26:37,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:26:37,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:26:37,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:26:37,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:26:37,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:26:37,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:26:37,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:26:37,938 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:26:37,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:26:37,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:26:37,939 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-28 00:26:38,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:26:38,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:26:38,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:26:38,199 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:26:38,200 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:26:38,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe018_rmo.oepc.yml/witness.yml [2024-06-28 00:26:38,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:26:38,292 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:26:38,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2024-06-28 00:26:39,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:26:39,737 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:26:39,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2024-06-28 00:26:39,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ffbfa5f/d7ec18c9894544c3afe546a332c3c983/FLAG97c1e69fd [2024-06-28 00:26:39,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ffbfa5f/d7ec18c9894544c3afe546a332c3c983 [2024-06-28 00:26:39,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:26:39,770 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:26:39,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:26:39,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:26:39,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:26:39,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:26:38" (1/2) ... [2024-06-28 00:26:39,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c392aa3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:26:39, skipping insertion in model container [2024-06-28 00:26:39,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:26:38" (1/2) ... [2024-06-28 00:26:39,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4b36664a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:26:39, skipping insertion in model container [2024-06-28 00:26:39,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:26:39" (2/2) ... [2024-06-28 00:26:39,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c392aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:39, skipping insertion in model container [2024-06-28 00:26:39,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:26:39" (2/2) ... [2024-06-28 00:26:39,783 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:26:39,808 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:26:39,809 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) [2024-06-28 00:26:39,810 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) [2024-06-28 00:26:39,810 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) [2024-06-28 00:26:39,810 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:26:39,810 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-28 00:26:39,853 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:26:40,216 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:26:40,233 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 00:26:40,495 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:26:40,547 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:26:40,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40 WrapperNode [2024-06-28 00:26:40,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:26:40,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:26:40,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:26:40,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:26:40,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,646 INFO L138 Inliner]: procedures = 175, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2024-06-28 00:26:40,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:26:40,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:26:40,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:26:40,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:26:40,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,688 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-28 00:26:40,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:26:40,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:26:40,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:26:40,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:26:40,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (1/1) ... [2024-06-28 00:26:40,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:26:40,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:26:40,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 00:26:40,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 00:26:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 00:26:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 00:26:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 00:26:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 00:26:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:26:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:26:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 00:26:40,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 00:26:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 00:26:40,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 00:26:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 00:26:40,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 00:26:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:26:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 00:26:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:26:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:26:40,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:26:40,824 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 00:26:40,952 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:26:40,954 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:26:41,553 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:26:41,553 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:26:41,864 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:26:41,865 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 00:26:41,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:26:41 BoogieIcfgContainer [2024-06-28 00:26:41,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:26:41,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:26:41,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:26:41,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:26:41,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:26:38" (1/4) ... [2024-06-28 00:26:41,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679b6a3e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:26:41, skipping insertion in model container [2024-06-28 00:26:41,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:26:39" (2/4) ... [2024-06-28 00:26:41,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679b6a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:26:41, skipping insertion in model container [2024-06-28 00:26:41,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:26:40" (3/4) ... [2024-06-28 00:26:41,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679b6a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:26:41, skipping insertion in model container [2024-06-28 00:26:41,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:26:41" (4/4) ... [2024-06-28 00:26:41,879 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2024-06-28 00:26:41,896 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:26:41,896 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 00:26:41,896 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:26:41,964 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 00:26:42,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-28 00:26:42,041 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-28 00:26:42,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:26:42,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 00:26:42,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-28 00:26:42,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-28 00:26:42,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:26:42,075 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@258bc889, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:26:42,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-28 00:26:42,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:26:42,080 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 00:26:42,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:26:42,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:42,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:26:42,082 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:42,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash 515712039, now seen corresponding path program 1 times [2024-06-28 00:26:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:42,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123839940] [2024-06-28 00:26:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:44,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:44,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123839940] [2024-06-28 00:26:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123839940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:44,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:26:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163344999] [2024-06-28 00:26:44,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:44,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:26:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:26:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:26:44,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-28 00:26:44,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-06-28 00:26:44,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:44,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-28 00:26:44,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:45,101 INFO L124 PetriNetUnfolderBase]: 602/990 cut-off events. [2024-06-28 00:26:45,101 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-06-28 00:26:45,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 990 events. 602/990 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4646 event pairs, 367 based on Foata normal form. 1/967 useless extension candidates. Maximal degree in co-relation 1965. Up to 930 conditions per place. [2024-06-28 00:26:45,113 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-28 00:26:45,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 175 flow [2024-06-28 00:26:45,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:26:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:26:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-28 00:26:45,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2024-06-28 00:26:45,127 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 72 transitions. [2024-06-28 00:26:45,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 175 flow [2024-06-28 00:26:45,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 00:26:45,154 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-28 00:26:45,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-28 00:26:45,160 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-28 00:26:45,160 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-28 00:26:45,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-06-28 00:26:45,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:45,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:26:45,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:26:45,162 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:45,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1678264248, now seen corresponding path program 1 times [2024-06-28 00:26:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871211022] [2024-06-28 00:26:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871211022] [2024-06-28 00:26:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871211022] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:26:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267892362] [2024-06-28 00:26:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:48,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:26:48,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:26:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:26:48,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-28 00:26:48,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06-28 00:26:48,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:48,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-28 00:26:48,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:48,972 INFO L124 PetriNetUnfolderBase]: 596/982 cut-off events. [2024-06-28 00:26:48,972 INFO L125 PetriNetUnfolderBase]: For 207/215 co-relation queries the response was YES. [2024-06-28 00:26:48,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 982 events. 596/982 cut-off events. For 207/215 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4638 event pairs, 277 based on Foata normal form. 6/986 useless extension candidates. Maximal degree in co-relation 2264. Up to 902 conditions per place. [2024-06-28 00:26:48,983 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 41 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-28 00:26:48,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 250 flow [2024-06-28 00:26:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:26:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:26:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-06-28 00:26:48,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5792682926829268 [2024-06-28 00:26:48,988 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 95 transitions. [2024-06-28 00:26:48,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 250 flow [2024-06-28 00:26:48,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:26:48,991 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-28 00:26:48,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-28 00:26:48,994 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-28 00:26:48,995 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-28 00:26:48,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06-28 00:26:48,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:48,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:26:48,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:26:48,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:48,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash -543025972, now seen corresponding path program 1 times [2024-06-28 00:26:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:48,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020165189] [2024-06-28 00:26:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:53,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020165189] [2024-06-28 00:26:53,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020165189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:53,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:53,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:26:53,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114688051] [2024-06-28 00:26:53,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:53,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:26:53,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:53,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:26:53,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:26:53,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-28 00:26:53,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-06-28 00:26:53,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:53,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-28 00:26:53,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:54,219 INFO L124 PetriNetUnfolderBase]: 754/1210 cut-off events. [2024-06-28 00:26:54,219 INFO L125 PetriNetUnfolderBase]: For 709/725 co-relation queries the response was YES. [2024-06-28 00:26:54,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 1210 events. 754/1210 cut-off events. For 709/725 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5529 event pairs, 215 based on Foata normal form. 12/1220 useless extension candidates. Maximal degree in co-relation 3130. Up to 1079 conditions per place. [2024-06-28 00:26:54,229 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 56 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2024-06-28 00:26:54,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 374 flow [2024-06-28 00:26:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:26:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:26:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-28 00:26:54,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532520325203252 [2024-06-28 00:26:54,233 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 6 states and 131 transitions. [2024-06-28 00:26:54,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 374 flow [2024-06-28 00:26:54,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 354 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 00:26:54,237 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 179 flow [2024-06-28 00:26:54,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-28 00:26:54,239 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2024-06-28 00:26:54,239 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 179 flow [2024-06-28 00:26:54,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-06-28 00:26:54,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:54,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:26:54,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:26:54,240 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:54,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1420126511, now seen corresponding path program 1 times [2024-06-28 00:26:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:54,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392868036] [2024-06-28 00:26:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:56,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392868036] [2024-06-28 00:26:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392868036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:56,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:56,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:26:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923197741] [2024-06-28 00:26:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:56,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:26:56,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:56,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:26:56,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:26:56,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:26:56,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-06-28 00:26:56,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:56,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:26:56,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:57,750 INFO L124 PetriNetUnfolderBase]: 863/1371 cut-off events. [2024-06-28 00:26:57,751 INFO L125 PetriNetUnfolderBase]: For 1467/1470 co-relation queries the response was YES. [2024-06-28 00:26:57,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3909 conditions, 1371 events. 863/1371 cut-off events. For 1467/1470 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6325 event pairs, 316 based on Foata normal form. 6/1375 useless extension candidates. Maximal degree in co-relation 3892. Up to 1268 conditions per place. [2024-06-28 00:26:57,760 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 51 selfloop transitions, 11 changer transitions 0/67 dead transitions. [2024-06-28 00:26:57,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 392 flow [2024-06-28 00:26:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:26:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:26:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-28 00:26:57,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-28 00:26:57,764 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 179 flow. Second operand 5 states and 92 transitions. [2024-06-28 00:26:57,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 392 flow [2024-06-28 00:26:57,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 357 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 00:26:57,771 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 238 flow [2024-06-28 00:26:57,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-06-28 00:26:57,773 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2024-06-28 00:26:57,773 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 238 flow [2024-06-28 00:26:57,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-06-28 00:26:57,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:57,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:26:57,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:26:57,775 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:57,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1057977362, now seen corresponding path program 1 times [2024-06-28 00:26:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:57,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043246480] [2024-06-28 00:26:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:00,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:00,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043246480] [2024-06-28 00:27:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043246480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:27:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760666844] [2024-06-28 00:27:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:00,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:27:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:27:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:27:00,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:00,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-06-28 00:27:00,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:00,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:00,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:01,781 INFO L124 PetriNetUnfolderBase]: 875/1391 cut-off events. [2024-06-28 00:27:01,781 INFO L125 PetriNetUnfolderBase]: For 2011/2019 co-relation queries the response was YES. [2024-06-28 00:27:01,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4309 conditions, 1391 events. 875/1391 cut-off events. For 2011/2019 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6371 event pairs, 278 based on Foata normal form. 14/1403 useless extension candidates. Maximal degree in co-relation 4287. Up to 1244 conditions per place. [2024-06-28 00:27:01,791 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 57 selfloop transitions, 14 changer transitions 0/76 dead transitions. [2024-06-28 00:27:01,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 458 flow [2024-06-28 00:27:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:27:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:27:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-28 00:27:01,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-28 00:27:01,794 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 238 flow. Second operand 7 states and 117 transitions. [2024-06-28 00:27:01,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 458 flow [2024-06-28 00:27:01,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 76 transitions, 456 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-28 00:27:01,798 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 292 flow [2024-06-28 00:27:01,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-06-28 00:27:01,799 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2024-06-28 00:27:01,799 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 292 flow [2024-06-28 00:27:01,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-06-28 00:27:01,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:01,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:01,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:27:01,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:01,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash 540009767, now seen corresponding path program 1 times [2024-06-28 00:27:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:01,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195799603] [2024-06-28 00:27:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:04,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:04,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195799603] [2024-06-28 00:27:04,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195799603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:04,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:04,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:27:04,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704699487] [2024-06-28 00:27:04,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:04,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:27:04,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:27:04,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:27:04,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:04,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 292 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:04,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:04,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:04,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:06,392 INFO L124 PetriNetUnfolderBase]: 1015/1622 cut-off events. [2024-06-28 00:27:06,392 INFO L125 PetriNetUnfolderBase]: For 3278/3284 co-relation queries the response was YES. [2024-06-28 00:27:06,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5484 conditions, 1622 events. 1015/1622 cut-off events. For 3278/3284 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7764 event pairs, 283 based on Foata normal form. 11/1632 useless extension candidates. Maximal degree in co-relation 5458. Up to 1370 conditions per place. [2024-06-28 00:27:06,404 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 85 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2024-06-28 00:27:06,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 129 transitions, 867 flow [2024-06-28 00:27:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:27:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:27:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-28 00:27:06,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070460704607047 [2024-06-28 00:27:06,408 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 292 flow. Second operand 9 states and 170 transitions. [2024-06-28 00:27:06,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 129 transitions, 867 flow [2024-06-28 00:27:06,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 129 transitions, 823 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 00:27:06,416 INFO L231 Difference]: Finished difference. Result has 67 places, 83 transitions, 562 flow [2024-06-28 00:27:06,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=562, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2024-06-28 00:27:06,419 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-28 00:27:06,419 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 562 flow [2024-06-28 00:27:06,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:06,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:06,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:06,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:27:06,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:06,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1723198453, now seen corresponding path program 2 times [2024-06-28 00:27:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037806247] [2024-06-28 00:27:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:06,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:08,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:08,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037806247] [2024-06-28 00:27:08,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037806247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:08,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:08,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:27:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228406533] [2024-06-28 00:27:08,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:08,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:27:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:08,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:27:08,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:27:08,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:08,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 562 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:08,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:08,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:08,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:10,187 INFO L124 PetriNetUnfolderBase]: 1166/1863 cut-off events. [2024-06-28 00:27:10,187 INFO L125 PetriNetUnfolderBase]: For 6246/6246 co-relation queries the response was YES. [2024-06-28 00:27:10,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 1863 events. 1166/1863 cut-off events. For 6246/6246 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9210 event pairs, 287 based on Foata normal form. 11/1873 useless extension candidates. Maximal degree in co-relation 7401. Up to 1452 conditions per place. [2024-06-28 00:27:10,205 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 90 selfloop transitions, 61 changer transitions 0/156 dead transitions. [2024-06-28 00:27:10,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 156 transitions, 1242 flow [2024-06-28 00:27:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:27:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:27:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 00:27:10,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-28 00:27:10,207 INFO L175 Difference]: Start difference. First operand has 67 places, 83 transitions, 562 flow. Second operand 10 states and 190 transitions. [2024-06-28 00:27:10,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 156 transitions, 1242 flow [2024-06-28 00:27:10,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 156 transitions, 1216 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-28 00:27:10,219 INFO L231 Difference]: Finished difference. Result has 78 places, 108 transitions, 912 flow [2024-06-28 00:27:10,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=912, PETRI_PLACES=78, PETRI_TRANSITIONS=108} [2024-06-28 00:27:10,220 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-28 00:27:10,220 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 108 transitions, 912 flow [2024-06-28 00:27:10,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:10,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:10,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:10,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:27:10,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:10,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash 537503961, now seen corresponding path program 3 times [2024-06-28 00:27:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:10,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027919723] [2024-06-28 00:27:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027919723] [2024-06-28 00:27:12,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027919723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:12,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:27:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652581985] [2024-06-28 00:27:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:12,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:27:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:12,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:27:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:27:12,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:12,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 108 transitions, 912 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:12,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:12,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:12,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:14,558 INFO L124 PetriNetUnfolderBase]: 1200/1916 cut-off events. [2024-06-28 00:27:14,558 INFO L125 PetriNetUnfolderBase]: For 10376/10376 co-relation queries the response was YES. [2024-06-28 00:27:14,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9206 conditions, 1916 events. 1200/1916 cut-off events. For 10376/10376 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9381 event pairs, 305 based on Foata normal form. 2/1917 useless extension candidates. Maximal degree in co-relation 9172. Up to 1602 conditions per place. [2024-06-28 00:27:14,578 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 119 selfloop transitions, 55 changer transitions 0/179 dead transitions. [2024-06-28 00:27:14,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 179 transitions, 1719 flow [2024-06-28 00:27:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:27:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:27:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-28 00:27:14,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-28 00:27:14,583 INFO L175 Difference]: Start difference. First operand has 78 places, 108 transitions, 912 flow. Second operand 10 states and 175 transitions. [2024-06-28 00:27:14,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 179 transitions, 1719 flow [2024-06-28 00:27:14,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 179 transitions, 1631 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-28 00:27:14,603 INFO L231 Difference]: Finished difference. Result has 87 places, 137 transitions, 1316 flow [2024-06-28 00:27:14,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1316, PETRI_PLACES=87, PETRI_TRANSITIONS=137} [2024-06-28 00:27:14,607 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2024-06-28 00:27:14,607 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 137 transitions, 1316 flow [2024-06-28 00:27:14,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:14,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:14,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:14,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:27:14,608 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:14,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:14,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1384943881, now seen corresponding path program 4 times [2024-06-28 00:27:14,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:14,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210052015] [2024-06-28 00:27:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:14,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:19,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:19,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210052015] [2024-06-28 00:27:19,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210052015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:19,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:19,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:27:19,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547616603] [2024-06-28 00:27:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:19,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:27:19,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:19,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:27:19,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:27:19,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:19,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 137 transitions, 1316 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:19,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:19,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:19,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:20,885 INFO L124 PetriNetUnfolderBase]: 1259/2029 cut-off events. [2024-06-28 00:27:20,885 INFO L125 PetriNetUnfolderBase]: For 12248/12259 co-relation queries the response was YES. [2024-06-28 00:27:20,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10476 conditions, 2029 events. 1259/2029 cut-off events. For 12248/12259 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10175 event pairs, 312 based on Foata normal form. 8/2034 useless extension candidates. Maximal degree in co-relation 10436. Up to 1733 conditions per place. [2024-06-28 00:27:20,912 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 127 selfloop transitions, 63 changer transitions 0/195 dead transitions. [2024-06-28 00:27:20,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 195 transitions, 2168 flow [2024-06-28 00:27:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:27:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:27:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-28 00:27:20,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-28 00:27:20,918 INFO L175 Difference]: Start difference. First operand has 87 places, 137 transitions, 1316 flow. Second operand 7 states and 133 transitions. [2024-06-28 00:27:20,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 195 transitions, 2168 flow [2024-06-28 00:27:20,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 195 transitions, 2115 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-28 00:27:20,953 INFO L231 Difference]: Finished difference. Result has 93 places, 165 transitions, 1784 flow [2024-06-28 00:27:20,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1784, PETRI_PLACES=93, PETRI_TRANSITIONS=165} [2024-06-28 00:27:20,955 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2024-06-28 00:27:20,955 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 165 transitions, 1784 flow [2024-06-28 00:27:20,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:20,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:20,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:20,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:27:20,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:20,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash 547435815, now seen corresponding path program 5 times [2024-06-28 00:27:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:20,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534094234] [2024-06-28 00:27:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:25,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534094234] [2024-06-28 00:27:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534094234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:25,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:25,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:27:25,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187414661] [2024-06-28 00:27:25,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:25,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:27:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:25,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:27:25,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:27:25,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:25,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 165 transitions, 1784 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:25,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:25,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:25,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:27,017 INFO L124 PetriNetUnfolderBase]: 1299/2083 cut-off events. [2024-06-28 00:27:27,017 INFO L125 PetriNetUnfolderBase]: For 14602/14615 co-relation queries the response was YES. [2024-06-28 00:27:27,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11274 conditions, 2083 events. 1299/2083 cut-off events. For 14602/14615 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10476 event pairs, 338 based on Foata normal form. 6/2083 useless extension candidates. Maximal degree in co-relation 11231. Up to 1699 conditions per place. [2024-06-28 00:27:27,038 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 124 selfloop transitions, 76 changer transitions 0/205 dead transitions. [2024-06-28 00:27:27,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 205 transitions, 2464 flow [2024-06-28 00:27:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:27:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:27:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-28 00:27:27,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-28 00:27:27,041 INFO L175 Difference]: Start difference. First operand has 93 places, 165 transitions, 1784 flow. Second operand 7 states and 133 transitions. [2024-06-28 00:27:27,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 205 transitions, 2464 flow [2024-06-28 00:27:27,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 205 transitions, 2384 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-06-28 00:27:27,068 INFO L231 Difference]: Finished difference. Result has 101 places, 180 transitions, 2090 flow [2024-06-28 00:27:27,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1704, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2090, PETRI_PLACES=101, PETRI_TRANSITIONS=180} [2024-06-28 00:27:27,069 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-28 00:27:27,069 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 180 transitions, 2090 flow [2024-06-28 00:27:27,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:27,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:27,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:27,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:27:27,070 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:27,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 203736337, now seen corresponding path program 6 times [2024-06-28 00:27:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:27,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405988838] [2024-06-28 00:27:27,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:31,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:31,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405988838] [2024-06-28 00:27:31,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405988838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:31,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:31,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:27:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369911740] [2024-06-28 00:27:31,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:31,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:27:31,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:31,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:27:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:27:31,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:31,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 180 transitions, 2090 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:31,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:31,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:31,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:32,671 INFO L124 PetriNetUnfolderBase]: 1291/2088 cut-off events. [2024-06-28 00:27:32,672 INFO L125 PetriNetUnfolderBase]: For 17023/17044 co-relation queries the response was YES. [2024-06-28 00:27:32,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11606 conditions, 2088 events. 1291/2088 cut-off events. For 17023/17044 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10565 event pairs, 321 based on Foata normal form. 8/2092 useless extension candidates. Maximal degree in co-relation 11558. Up to 1691 conditions per place. [2024-06-28 00:27:32,696 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 121 selfloop transitions, 79 changer transitions 0/205 dead transitions. [2024-06-28 00:27:32,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 205 transitions, 2612 flow [2024-06-28 00:27:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:27:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:27:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-28 00:27:32,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2024-06-28 00:27:32,699 INFO L175 Difference]: Start difference. First operand has 101 places, 180 transitions, 2090 flow. Second operand 7 states and 127 transitions. [2024-06-28 00:27:32,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 205 transitions, 2612 flow [2024-06-28 00:27:32,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 205 transitions, 2438 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-06-28 00:27:32,732 INFO L231 Difference]: Finished difference. Result has 105 places, 182 transitions, 2123 flow [2024-06-28 00:27:32,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2123, PETRI_PLACES=105, PETRI_TRANSITIONS=182} [2024-06-28 00:27:32,733 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-28 00:27:32,733 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 182 transitions, 2123 flow [2024-06-28 00:27:32,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:32,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:32,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:32,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:27:32,734 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:32,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1191042029, now seen corresponding path program 1 times [2024-06-28 00:27:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:32,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682350470] [2024-06-28 00:27:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:36,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682350470] [2024-06-28 00:27:36,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682350470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:36,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:36,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:27:36,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932258105] [2024-06-28 00:27:36,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:36,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:27:36,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:36,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:27:36,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:27:36,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:36,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 182 transitions, 2123 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:36,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:36,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:36,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:37,657 INFO L124 PetriNetUnfolderBase]: 1283/2078 cut-off events. [2024-06-28 00:27:37,657 INFO L125 PetriNetUnfolderBase]: For 19303/19328 co-relation queries the response was YES. [2024-06-28 00:27:37,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11522 conditions, 2078 events. 1283/2078 cut-off events. For 19303/19328 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10684 event pairs, 393 based on Foata normal form. 22/2097 useless extension candidates. Maximal degree in co-relation 11473. Up to 1738 conditions per place. [2024-06-28 00:27:37,676 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 167 selfloop transitions, 40 changer transitions 0/212 dead transitions. [2024-06-28 00:27:37,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 212 transitions, 2679 flow [2024-06-28 00:27:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:27:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:27:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 00:27:37,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-28 00:27:37,679 INFO L175 Difference]: Start difference. First operand has 105 places, 182 transitions, 2123 flow. Second operand 8 states and 133 transitions. [2024-06-28 00:27:37,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 212 transitions, 2679 flow [2024-06-28 00:27:37,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 212 transitions, 2520 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-28 00:27:37,713 INFO L231 Difference]: Finished difference. Result has 110 places, 184 transitions, 2083 flow [2024-06-28 00:27:37,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1964, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2083, PETRI_PLACES=110, PETRI_TRANSITIONS=184} [2024-06-28 00:27:37,714 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-28 00:27:37,714 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 184 transitions, 2083 flow [2024-06-28 00:27:37,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06-28 00:27:37,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:37,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:37,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:27:37,715 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:37,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 322990452, now seen corresponding path program 1 times [2024-06-28 00:27:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983980042] [2024-06-28 00:27:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:40,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:40,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983980042] [2024-06-28 00:27:40,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983980042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:40,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:40,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:27:40,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303579637] [2024-06-28 00:27:40,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:40,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:27:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:40,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:27:40,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:27:40,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:40,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 184 transitions, 2083 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:27:40,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:40,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:40,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:42,003 INFO L124 PetriNetUnfolderBase]: 1681/2733 cut-off events. [2024-06-28 00:27:42,003 INFO L125 PetriNetUnfolderBase]: For 27143/27143 co-relation queries the response was YES. [2024-06-28 00:27:42,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14593 conditions, 2733 events. 1681/2733 cut-off events. For 27143/27143 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14864 event pairs, 314 based on Foata normal form. 24/2756 useless extension candidates. Maximal degree in co-relation 14543. Up to 1551 conditions per place. [2024-06-28 00:27:42,025 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 139 selfloop transitions, 114 changer transitions 0/258 dead transitions. [2024-06-28 00:27:42,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 258 transitions, 3053 flow [2024-06-28 00:27:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:27:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:27:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions. [2024-06-28 00:27:42,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48337028824833705 [2024-06-28 00:27:42,028 INFO L175 Difference]: Start difference. First operand has 110 places, 184 transitions, 2083 flow. Second operand 11 states and 218 transitions. [2024-06-28 00:27:42,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 258 transitions, 3053 flow [2024-06-28 00:27:42,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 258 transitions, 2965 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 00:27:42,072 INFO L231 Difference]: Finished difference. Result has 117 places, 194 transitions, 2386 flow [2024-06-28 00:27:42,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2386, PETRI_PLACES=117, PETRI_TRANSITIONS=194} [2024-06-28 00:27:42,073 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-28 00:27:42,073 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 194 transitions, 2386 flow [2024-06-28 00:27:42,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:27:42,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:42,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:42,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:27:42,074 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:42,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1863622188, now seen corresponding path program 2 times [2024-06-28 00:27:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657406043] [2024-06-28 00:27:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:44,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:44,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657406043] [2024-06-28 00:27:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657406043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:44,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:27:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302647572] [2024-06-28 00:27:44,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:44,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:27:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:27:44,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:27:44,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:44,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 194 transitions, 2386 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:27:44,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:44,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:44,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:46,420 INFO L124 PetriNetUnfolderBase]: 1677/2742 cut-off events. [2024-06-28 00:27:46,421 INFO L125 PetriNetUnfolderBase]: For 32007/32007 co-relation queries the response was YES. [2024-06-28 00:27:46,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15253 conditions, 2742 events. 1677/2742 cut-off events. For 32007/32007 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15075 event pairs, 367 based on Foata normal form. 40/2781 useless extension candidates. Maximal degree in co-relation 15201. Up to 1889 conditions per place. [2024-06-28 00:27:46,448 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 136 selfloop transitions, 110 changer transitions 0/251 dead transitions. [2024-06-28 00:27:46,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 251 transitions, 3200 flow [2024-06-28 00:27:46,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:27:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:27:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 00:27:46,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-28 00:27:46,451 INFO L175 Difference]: Start difference. First operand has 117 places, 194 transitions, 2386 flow. Second operand 11 states and 209 transitions. [2024-06-28 00:27:46,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 251 transitions, 3200 flow [2024-06-28 00:27:46,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 251 transitions, 3042 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-28 00:27:46,514 INFO L231 Difference]: Finished difference. Result has 121 places, 198 transitions, 2528 flow [2024-06-28 00:27:46,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2528, PETRI_PLACES=121, PETRI_TRANSITIONS=198} [2024-06-28 00:27:46,514 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-28 00:27:46,515 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 198 transitions, 2528 flow [2024-06-28 00:27:46,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:27:46,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:46,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:46,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:27:46,516 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:46,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash -896688074, now seen corresponding path program 3 times [2024-06-28 00:27:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:46,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247859621] [2024-06-28 00:27:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:46,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:48,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247859621] [2024-06-28 00:27:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247859621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:48,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:27:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221259405] [2024-06-28 00:27:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:48,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:27:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:48,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:27:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:27:48,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-28 00:27:48,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 198 transitions, 2528 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-06-28 00:27:48,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:48,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-28 00:27:48,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:49,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L785-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_1| 0) (= |v_P0Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_1|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_1|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, P0Thread1of1ForFork2_#res.base][38], [Black: 243#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 200#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~__unbuffered_p0_EBX~0 1) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 119#true, Black: 135#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 242#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 98#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), 258#true, Black: 90#(and (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0)), 8#P0EXITtrue, Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 162#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 73#true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 1) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (or (and (= ~y$flush_delayed~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~weak$$choice2~0 1) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd1~0 0)), 10#L836-7true, P0Thread1of1ForFork2InUse, 25#$Ultimate##0true, P1Thread1of1ForFork1InUse, 297#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 104#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 177#(and (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$w_buff1_used~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)) (= ~y$r_buff1_thd1~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$read_delayed~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~weak$$choice2~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~weak$$choice0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 181#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 144#true]) [2024-06-28 00:27:49,888 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2024-06-28 00:27:49,888 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-06-28 00:27:49,888 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-06-28 00:27:49,888 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-06-28 00:27:49,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L785-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_1| 0) (= |v_P0Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_1|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_1|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, P0Thread1of1ForFork2_#res.base][38], [Black: 243#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 44#L836-8true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 200#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~__unbuffered_p0_EBX~0 1) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 119#true, Black: 135#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 242#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 98#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), 258#true, Black: 90#(and (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0)), 8#P0EXITtrue, Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 162#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 73#true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 1) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (or (and (= ~y$flush_delayed~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~weak$$choice2~0 1) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 25#$Ultimate##0true, P1Thread1of1ForFork1InUse, 4#$Ultimate##0true, 297#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 104#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 177#(and (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$w_buff1_used~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)) (= ~y$r_buff1_thd1~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0)), Black: 181#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$read_delayed~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~weak$$choice2~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~weak$$choice0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 144#true]) [2024-06-28 00:27:49,918 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-06-28 00:27:49,918 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-28 00:27:49,918 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-28 00:27:49,918 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-28 00:27:49,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L790-->L792: Formula: (= v_~x~0_2 1) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][46], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 242#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 30#L792true, 299#(and (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 70#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 243#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 200#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~__unbuffered_p0_EBX~0 1) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 119#true, Black: 135#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 98#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), 258#true, Black: 90#(and (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 29#L785true, Black: 162#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 73#true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 1) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (or (and (= ~y$flush_delayed~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~weak$$choice2~0 1) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd1~0 0)), 10#L836-7true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 104#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 177#(and (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$w_buff1_used~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)) (= ~y$r_buff1_thd1~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0)), Black: 181#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$read_delayed~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~weak$$choice2~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~weak$$choice0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 144#true]) [2024-06-28 00:27:49,972 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-28 00:27:49,972 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-28 00:27:49,973 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-28 00:27:49,973 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-28 00:27:49,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L785-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_1| 0) (= |v_P0Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_1|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_1|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, P0Thread1of1ForFork2_#res.base][38], [Black: 243#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 200#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~__unbuffered_p0_EBX~0 1) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 119#true, Black: 135#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 242#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 98#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), 23#L837true, 258#true, Black: 90#(and (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0)), 8#P0EXITtrue, Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 162#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 73#true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 1) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (or (and (= ~y$flush_delayed~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~weak$$choice2~0 1) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 25#$Ultimate##0true, P1Thread1of1ForFork1InUse, 4#$Ultimate##0true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 297#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 104#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 177#(and (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$w_buff1_used~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)) (= ~y$r_buff1_thd1~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0)), Black: 181#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$read_delayed~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~weak$$choice2~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~weak$$choice0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 144#true]) [2024-06-28 00:27:49,974 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-28 00:27:49,974 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-28 00:27:49,974 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-28 00:27:49,974 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-28 00:27:50,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L790-->L792: Formula: (= v_~x~0_2 1) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][46], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 242#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 30#L792true, 299#(and (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 44#L836-8true, Black: 70#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 243#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 200#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~__unbuffered_p0_EBX~0 1) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 119#true, Black: 135#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 98#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), 258#true, Black: 90#(and (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 29#L785true, Black: 162#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 73#true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 1) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (or (and (= ~y$flush_delayed~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~weak$$choice2~0 1) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 4#$Ultimate##0true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 104#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 177#(and (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$w_buff1_used~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)) (= ~y$r_buff1_thd1~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0)), Black: 181#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$read_delayed~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~weak$$choice2~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~weak$$choice0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 144#true]) [2024-06-28 00:27:50,009 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-06-28 00:27:50,009 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 00:27:50,010 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 00:27:50,010 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 00:27:50,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L802-->L804: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~x~0=v_~x~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0][139], [Black: 243#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 242#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 44#L836-8true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 200#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~__unbuffered_p0_EBX~0 1) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 119#true, Black: 135#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 236#true, Black: 265#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 98#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), 258#true, Black: 90#(and (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 29#L785true, Black: 162#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 73#true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 1) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (or (and (= ~y$flush_delayed~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~weak$$choice2~0 1) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 25#$Ultimate##0true, P1Thread1of1ForFork1InUse, 297#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 104#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 177#(and (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$w_buff1_used~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)) (= ~y$r_buff1_thd1~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0)), 12#L804true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$read_delayed~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~weak$$choice2~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~weak$$choice0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 144#true]) [2024-06-28 00:27:50,012 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-06-28 00:27:50,012 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 00:27:50,012 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 00:27:50,012 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 00:27:50,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L802-->L804: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~x~0=v_~x~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0][139], [Black: 243#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 242#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 200#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~__unbuffered_p0_EBX~0 1) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 119#true, Black: 135#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 236#true, Black: 265#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 98#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), 23#L837true, 258#true, Black: 90#(and (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 29#L785true, Black: 162#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 73#true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 1) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (or (and (= ~y$flush_delayed~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~weak$$choice2~0 1) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 25#$Ultimate##0true, P1Thread1of1ForFork1InUse, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 297#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 104#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 177#(and (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$w_buff1_used~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)) (= ~y$r_buff1_thd1~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0)), 12#L804true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$read_delayed~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~weak$$choice2~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~weak$$choice0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 144#true]) [2024-06-28 00:27:50,013 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-28 00:27:50,013 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 00:27:50,013 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 00:27:50,013 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 00:27:50,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L790-->L792: Formula: (= v_~x~0_2 1) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][46], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (and (<= 0 (div ~weak$$choice2~0 256)) (<= ~weak$$choice2~0 1))) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 242#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 30#L792true, 299#(and (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 70#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 243#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (or (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0)) (and (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= ~weak$$choice2~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), Black: 200#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~__unbuffered_p0_EBX~0 1) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~x~0 1) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 137#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 123#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 119#true, Black: 135#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), 98#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (= (* (div ~weak$$choice2~0 256) 256) ~weak$$choice2~0) (= ~weak$$choice2~0 1))) (= |#ghost~multithreaded| 0))), 23#L837true, 258#true, Black: 90#(and (= ~__unbuffered_p0_EAX$w_buff0~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 29#L785true, Black: 162#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 73#true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 1) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 234#(and (or (and (= ~y$flush_delayed~0 0) (<= 0 (div ~weak$$choice2~0 256)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~weak$$choice2~0 1) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 4#$Ultimate##0true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= 0 (+ ~y$w_buff0~0 1)) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 104#(or (= |#ghost~multithreaded| 0) (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (+ ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (<= 0 (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= (+ ~weak$$choice0~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice0~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0~0 1) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= (+ ~weak$$choice2~0 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256))) (+ (* (div ~weak$$choice2~0 256) 256) ~__unbuffered_p0_EAX$read_delayed~0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~y$w_buff1_used~0 (+ (* 256 (div ~y$w_buff1_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$read_delayed~0 (+ 2 (* 256 (div ~__unbuffered_p0_EAX$read_delayed~0 256)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)))), Black: 177#(and (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$w_buff1_used~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)) (= ~y$r_buff1_thd1~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (= ~y$mem_tmp~0 0)), Black: 181#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (or (and (<= ~__unbuffered_p0_EAX$w_buff0_used~0 (+ (* 256 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) 1)) (<= ~__unbuffered_p0_EAX$flush_delayed~0 (+ 1 (* 256 (div ~__unbuffered_p0_EAX$flush_delayed~0 256)))) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd2~0 256)) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd3~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd3~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd1~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff0_thd1~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd0~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd0~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff0_thd0~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff0_thd0~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$w_buff1_used~0 (+ (* (div ~__unbuffered_p0_EAX$w_buff1_used~0 256) 256) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd1~0 (+ (* (div ~__unbuffered_p0_EAX$r_buff1_thd1~0 256) 256) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd2~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd2~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~__unbuffered_p0_EAX$r_buff1_thd3~0 (+ (* 256 (div ~__unbuffered_p0_EAX$r_buff1_thd3~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p0_EAX$read_delayed~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (or (= ~weak$$choice0~0 0) (= ~weak$$choice0~0 1)) (or (and (<= ~weak$$choice2~0 0) (<= 0 (div ~weak$$choice2~0 256))) (= ~weak$$choice2~0 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 (div ~__unbuffered_p0_EAX$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX$read_delayed~0 0) (= ~__unbuffered_p0_EAX$w_buff0~0 0) (= ~__unbuffered_p0_EAX$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd0~0 0) (= (select (select |#memory_int#1| |~#y~0.base|) |~#y~0.offset|) 0) (= ~__unbuffered_p0_EAX$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~__unbuffered_p0_EAX$r_buff1_thd2~0 0) (<= ~__unbuffered_p0_EAX$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$w_buff1_used~0 0) (= ~__unbuffered_p0_EAX$w_buff1~0 0) (= ~__unbuffered_p0_EAX$mem_tmp~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd3~0 0) (= ~weak$$choice2~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd3~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~weak$$choice0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p0_EAX$r_buff0_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p0_EAX$r_buff1_thd1~0 0)), 144#true]) [2024-06-28 00:27:50,044 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-28 00:27:50,044 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-28 00:27:50,044 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-28 00:27:50,044 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-28 00:27:50,336 INFO L124 PetriNetUnfolderBase]: 1898/3370 cut-off events. [2024-06-28 00:27:50,336 INFO L125 PetriNetUnfolderBase]: For 43435/43628 co-relation queries the response was YES. [2024-06-28 00:27:50,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18584 conditions, 3370 events. 1898/3370 cut-off events. For 43435/43628 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 21735 event pairs, 259 based on Foata normal form. 118/3381 useless extension candidates. Maximal degree in co-relation 18530. Up to 1119 conditions per place. [2024-06-28 00:27:50,366 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 113 selfloop transitions, 92 changer transitions 0/272 dead transitions. [2024-06-28 00:27:50,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 272 transitions, 3499 flow [2024-06-28 00:27:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:27:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:27:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2024-06-28 00:27:50,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195121951219512 [2024-06-28 00:27:50,369 INFO L175 Difference]: Start difference. First operand has 121 places, 198 transitions, 2528 flow. Second operand 10 states and 213 transitions. [2024-06-28 00:27:50,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 272 transitions, 3499 flow [2024-06-28 00:27:50,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 272 transitions, 3295 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-28 00:27:50,476 INFO L231 Difference]: Finished difference. Result has 126 places, 216 transitions, 2875 flow [2024-06-28 00:27:50,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2875, PETRI_PLACES=126, PETRI_TRANSITIONS=216} [2024-06-28 00:27:50,478 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2024-06-28 00:27:50,478 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 216 transitions, 2875 flow [2024-06-28 00:27:50,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-06-28 00:27:50,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:50,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:50,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:27:50,479 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:50,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:50,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1145271736, now seen corresponding path program 4 times [2024-06-28 00:27:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:50,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821365975] [2024-06-28 00:27:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:53,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:53,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821365975] [2024-06-28 00:27:53,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821365975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:53,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:53,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:27:53,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021345885] [2024-06-28 00:27:53,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:53,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:27:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:27:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:27:53,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:53,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 216 transitions, 2875 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:27:53,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:53,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:53,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:55,854 INFO L124 PetriNetUnfolderBase]: 2464/4046 cut-off events. [2024-06-28 00:27:55,854 INFO L125 PetriNetUnfolderBase]: For 59704/59704 co-relation queries the response was YES. [2024-06-28 00:27:55,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24284 conditions, 4046 events. 2464/4046 cut-off events. For 59704/59704 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 24459 event pairs, 743 based on Foata normal form. 16/4061 useless extension candidates. Maximal degree in co-relation 24225. Up to 3458 conditions per place. [2024-06-28 00:27:55,881 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 175 selfloop transitions, 84 changer transitions 0/264 dead transitions. [2024-06-28 00:27:55,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 264 transitions, 3613 flow [2024-06-28 00:27:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:27:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:27:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-28 00:27:55,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212860310421286 [2024-06-28 00:27:55,884 INFO L175 Difference]: Start difference. First operand has 126 places, 216 transitions, 2875 flow. Second operand 11 states and 190 transitions. [2024-06-28 00:27:55,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 264 transitions, 3613 flow [2024-06-28 00:27:56,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 264 transitions, 3553 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-28 00:27:56,017 INFO L231 Difference]: Finished difference. Result has 133 places, 217 transitions, 3018 flow [2024-06-28 00:27:56,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2815, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3018, PETRI_PLACES=133, PETRI_TRANSITIONS=217} [2024-06-28 00:27:56,018 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2024-06-28 00:27:56,019 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 217 transitions, 3018 flow [2024-06-28 00:27:56,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:27:56,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:56,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:27:56,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 00:27:56,023 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:56,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1145456186, now seen corresponding path program 1 times [2024-06-28 00:27:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:56,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103931738] [2024-06-28 00:27:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:59,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103931738] [2024-06-28 00:27:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103931738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:59,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:59,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:27:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893026089] [2024-06-28 00:27:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:59,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:27:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:27:59,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:27:59,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:27:59,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 217 transitions, 3018 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:27:59,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:59,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:27:59,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:01,153 INFO L124 PetriNetUnfolderBase]: 2512/4140 cut-off events. [2024-06-28 00:28:01,153 INFO L125 PetriNetUnfolderBase]: For 61251/61251 co-relation queries the response was YES. [2024-06-28 00:28:01,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24854 conditions, 4140 events. 2512/4140 cut-off events. For 61251/61251 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 25101 event pairs, 685 based on Foata normal form. 12/4151 useless extension candidates. Maximal degree in co-relation 24794. Up to 3270 conditions per place. [2024-06-28 00:28:01,187 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 176 selfloop transitions, 87 changer transitions 0/268 dead transitions. [2024-06-28 00:28:01,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 268 transitions, 3780 flow [2024-06-28 00:28:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:28:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:28:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-06-28 00:28:01,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4279379157427938 [2024-06-28 00:28:01,189 INFO L175 Difference]: Start difference. First operand has 133 places, 217 transitions, 3018 flow. Second operand 11 states and 193 transitions. [2024-06-28 00:28:01,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 268 transitions, 3780 flow [2024-06-28 00:28:01,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 268 transitions, 3601 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-28 00:28:01,283 INFO L231 Difference]: Finished difference. Result has 136 places, 218 transitions, 3047 flow [2024-06-28 00:28:01,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2839, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3047, PETRI_PLACES=136, PETRI_TRANSITIONS=218} [2024-06-28 00:28:01,284 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-28 00:28:01,284 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 218 transitions, 3047 flow [2024-06-28 00:28:01,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:01,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:01,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:01,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 00:28:01,285 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:01,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash -511608344, now seen corresponding path program 5 times [2024-06-28 00:28:01,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:01,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614981251] [2024-06-28 00:28:01,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:01,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:28:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:28:06,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:28:06,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614981251] [2024-06-28 00:28:06,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614981251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:28:06,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:28:06,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:28:06,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369157292] [2024-06-28 00:28:06,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:28:06,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:28:06,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:28:06,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:28:06,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:28:06,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:28:06,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 218 transitions, 3047 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:06,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:28:06,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:28:06,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:08,818 INFO L124 PetriNetUnfolderBase]: 2855/4746 cut-off events. [2024-06-28 00:28:08,818 INFO L125 PetriNetUnfolderBase]: For 67928/67939 co-relation queries the response was YES. [2024-06-28 00:28:08,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27450 conditions, 4746 events. 2855/4746 cut-off events. For 67928/67939 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 30015 event pairs, 819 based on Foata normal form. 28/4769 useless extension candidates. Maximal degree in co-relation 27389. Up to 3472 conditions per place. [2024-06-28 00:28:08,852 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 193 selfloop transitions, 80 changer transitions 0/278 dead transitions. [2024-06-28 00:28:08,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 278 transitions, 4052 flow [2024-06-28 00:28:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:28:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:28:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 00:28:08,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-28 00:28:08,854 INFO L175 Difference]: Start difference. First operand has 136 places, 218 transitions, 3047 flow. Second operand 10 states and 183 transitions. [2024-06-28 00:28:08,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 278 transitions, 4052 flow [2024-06-28 00:28:08,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 278 transitions, 3877 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-28 00:28:08,955 INFO L231 Difference]: Finished difference. Result has 139 places, 231 transitions, 3297 flow [2024-06-28 00:28:08,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3297, PETRI_PLACES=139, PETRI_TRANSITIONS=231} [2024-06-28 00:28:08,956 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-28 00:28:08,956 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 231 transitions, 3297 flow [2024-06-28 00:28:08,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:08,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:08,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:08,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:28:08,957 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:08,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:08,957 INFO L85 PathProgramCache]: Analyzing trace with hash -397928864, now seen corresponding path program 6 times [2024-06-28 00:28:08,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:08,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754997477] [2024-06-28 00:28:08,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:08,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:28:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:28:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:28:13,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754997477] [2024-06-28 00:28:13,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754997477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:28:13,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:28:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:28:13,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487319797] [2024-06-28 00:28:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:28:13,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:28:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:28:13,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:28:13,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:28:13,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:28:13,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 231 transitions, 3297 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:13,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:28:13,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:28:13,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:15,248 INFO L124 PetriNetUnfolderBase]: 2773/4608 cut-off events. [2024-06-28 00:28:15,248 INFO L125 PetriNetUnfolderBase]: For 70506/70517 co-relation queries the response was YES. [2024-06-28 00:28:15,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26863 conditions, 4608 events. 2773/4608 cut-off events. For 70506/70517 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29006 event pairs, 878 based on Foata normal form. 44/4647 useless extension candidates. Maximal degree in co-relation 26800. Up to 3798 conditions per place. [2024-06-28 00:28:15,284 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 192 selfloop transitions, 69 changer transitions 0/266 dead transitions. [2024-06-28 00:28:15,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 266 transitions, 3964 flow [2024-06-28 00:28:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:28:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:28:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 00:28:15,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-28 00:28:15,287 INFO L175 Difference]: Start difference. First operand has 139 places, 231 transitions, 3297 flow. Second operand 9 states and 160 transitions. [2024-06-28 00:28:15,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 266 transitions, 3964 flow [2024-06-28 00:28:15,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 266 transitions, 3822 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-28 00:28:15,420 INFO L231 Difference]: Finished difference. Result has 144 places, 231 transitions, 3316 flow [2024-06-28 00:28:15,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3155, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3316, PETRI_PLACES=144, PETRI_TRANSITIONS=231} [2024-06-28 00:28:15,420 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2024-06-28 00:28:15,421 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 231 transitions, 3316 flow [2024-06-28 00:28:15,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:15,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:15,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:15,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:28:15,421 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:15,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:15,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1655551612, now seen corresponding path program 7 times [2024-06-28 00:28:15,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:15,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629011718] [2024-06-28 00:28:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:28:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:28:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:28:19,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629011718] [2024-06-28 00:28:19,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629011718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:28:19,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:28:19,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:28:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180097981] [2024-06-28 00:28:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:28:19,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:28:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:28:19,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:28:19,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:28:19,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:28:19,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 231 transitions, 3316 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:19,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:28:19,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:28:19,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:21,607 INFO L124 PetriNetUnfolderBase]: 2889/4813 cut-off events. [2024-06-28 00:28:21,608 INFO L125 PetriNetUnfolderBase]: For 70281/70294 co-relation queries the response was YES. [2024-06-28 00:28:21,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27797 conditions, 4813 events. 2889/4813 cut-off events. For 70281/70294 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 30833 event pairs, 890 based on Foata normal form. 19/4826 useless extension candidates. Maximal degree in co-relation 27733. Up to 4109 conditions per place. [2024-06-28 00:28:21,643 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 180 selfloop transitions, 80 changer transitions 0/265 dead transitions. [2024-06-28 00:28:21,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 265 transitions, 4001 flow [2024-06-28 00:28:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:28:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:28:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 00:28:21,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-28 00:28:21,646 INFO L175 Difference]: Start difference. First operand has 144 places, 231 transitions, 3316 flow. Second operand 8 states and 149 transitions. [2024-06-28 00:28:21,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 265 transitions, 4001 flow [2024-06-28 00:28:21,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 265 transitions, 3880 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 00:28:21,765 INFO L231 Difference]: Finished difference. Result has 145 places, 233 transitions, 3414 flow [2024-06-28 00:28:21,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3195, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3414, PETRI_PLACES=145, PETRI_TRANSITIONS=233} [2024-06-28 00:28:21,766 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2024-06-28 00:28:21,766 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 233 transitions, 3414 flow [2024-06-28 00:28:21,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:21,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:21,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:21,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:28:21,767 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:21,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2031626696, now seen corresponding path program 2 times [2024-06-28 00:28:21,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:21,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707255436] [2024-06-28 00:28:21,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:28:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:28:26,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:28:26,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707255436] [2024-06-28 00:28:26,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707255436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:28:26,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:28:26,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:28:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842002804] [2024-06-28 00:28:26,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:28:26,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:28:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:28:26,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:28:26,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:28:26,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:28:26,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 233 transitions, 3414 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:26,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:28:26,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:28:26,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:28,030 INFO L124 PetriNetUnfolderBase]: 2985/4973 cut-off events. [2024-06-28 00:28:28,030 INFO L125 PetriNetUnfolderBase]: For 76119/76132 co-relation queries the response was YES. [2024-06-28 00:28:28,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28870 conditions, 4973 events. 2985/4973 cut-off events. For 76119/76132 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 32060 event pairs, 884 based on Foata normal form. 15/4982 useless extension candidates. Maximal degree in co-relation 28805. Up to 3731 conditions per place. [2024-06-28 00:28:28,070 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 178 selfloop transitions, 91 changer transitions 0/274 dead transitions. [2024-06-28 00:28:28,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 274 transitions, 4182 flow [2024-06-28 00:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:28:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:28:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-28 00:28:28,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-28 00:28:28,071 INFO L175 Difference]: Start difference. First operand has 145 places, 233 transitions, 3414 flow. Second operand 9 states and 159 transitions. [2024-06-28 00:28:28,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 274 transitions, 4182 flow [2024-06-28 00:28:28,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 274 transitions, 4012 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-28 00:28:28,200 INFO L231 Difference]: Finished difference. Result has 149 places, 237 transitions, 3545 flow [2024-06-28 00:28:28,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3244, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3545, PETRI_PLACES=149, PETRI_TRANSITIONS=237} [2024-06-28 00:28:28,200 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-28 00:28:28,200 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 237 transitions, 3545 flow [2024-06-28 00:28:28,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:28,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:28,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:28,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 00:28:28,201 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:28,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1662420264, now seen corresponding path program 8 times [2024-06-28 00:28:28,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:28,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536893801] [2024-06-28 00:28:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:28:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:28:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:28:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536893801] [2024-06-28 00:28:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536893801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:28:32,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:28:32,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:28:32,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205444984] [2024-06-28 00:28:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:28:32,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:28:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:28:32,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:28:32,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:28:32,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:28:32,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 237 transitions, 3545 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:32,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:28:32,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:28:32,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:34,451 INFO L124 PetriNetUnfolderBase]: 3025/5073 cut-off events. [2024-06-28 00:28:34,451 INFO L125 PetriNetUnfolderBase]: For 82380/82399 co-relation queries the response was YES. [2024-06-28 00:28:34,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29630 conditions, 5073 events. 3025/5073 cut-off events. For 82380/82399 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 32996 event pairs, 913 based on Foata normal form. 21/5090 useless extension candidates. Maximal degree in co-relation 29563. Up to 4417 conditions per place. [2024-06-28 00:28:34,490 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 185 selfloop transitions, 80 changer transitions 0/270 dead transitions. [2024-06-28 00:28:34,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 270 transitions, 4247 flow [2024-06-28 00:28:34,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:28:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:28:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 00:28:34,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-28 00:28:34,492 INFO L175 Difference]: Start difference. First operand has 149 places, 237 transitions, 3545 flow. Second operand 9 states and 153 transitions. [2024-06-28 00:28:34,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 270 transitions, 4247 flow [2024-06-28 00:28:34,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 270 transitions, 4078 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-28 00:28:34,610 INFO L231 Difference]: Finished difference. Result has 152 places, 238 transitions, 3581 flow [2024-06-28 00:28:34,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3376, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3581, PETRI_PLACES=152, PETRI_TRANSITIONS=238} [2024-06-28 00:28:34,610 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-28 00:28:34,611 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 238 transitions, 3581 flow [2024-06-28 00:28:34,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:34,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:34,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:34,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 00:28:34,611 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:34,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:34,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1968576884, now seen corresponding path program 3 times [2024-06-28 00:28:34,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:34,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201330986] [2024-06-28 00:28:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:34,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:28:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:28:38,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:28:38,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201330986] [2024-06-28 00:28:38,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201330986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:28:38,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:28:38,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:28:38,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133198036] [2024-06-28 00:28:38,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:28:38,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:28:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:28:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:28:38,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:28:38,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:28:38,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 238 transitions, 3581 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:38,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:28:38,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:28:38,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:40,583 INFO L124 PetriNetUnfolderBase]: 3073/5166 cut-off events. [2024-06-28 00:28:40,584 INFO L125 PetriNetUnfolderBase]: For 86840/86857 co-relation queries the response was YES. [2024-06-28 00:28:40,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30179 conditions, 5166 events. 3073/5166 cut-off events. For 86840/86857 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33881 event pairs, 917 based on Foata normal form. 15/5177 useless extension candidates. Maximal degree in co-relation 30112. Up to 4391 conditions per place. [2024-06-28 00:28:40,620 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 187 selfloop transitions, 82 changer transitions 0/274 dead transitions. [2024-06-28 00:28:40,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 274 transitions, 4309 flow [2024-06-28 00:28:40,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:28:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:28:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 00:28:40,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-28 00:28:40,622 INFO L175 Difference]: Start difference. First operand has 152 places, 238 transitions, 3581 flow. Second operand 8 states and 148 transitions. [2024-06-28 00:28:40,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 274 transitions, 4309 flow [2024-06-28 00:28:40,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 274 transitions, 4130 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-28 00:28:40,752 INFO L231 Difference]: Finished difference. Result has 153 places, 239 transitions, 3610 flow [2024-06-28 00:28:40,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3402, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3610, PETRI_PLACES=153, PETRI_TRANSITIONS=239} [2024-06-28 00:28:40,753 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places. [2024-06-28 00:28:40,753 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 239 transitions, 3610 flow [2024-06-28 00:28:40,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:40,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:40,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:40,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 00:28:40,753 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:40,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1732401524, now seen corresponding path program 4 times [2024-06-28 00:28:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:40,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613466302] [2024-06-28 00:28:40,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:28:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:28:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:28:44,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613466302] [2024-06-28 00:28:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613466302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:28:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:28:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:28:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802032756] [2024-06-28 00:28:44,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:28:44,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:28:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:28:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:28:44,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:28:44,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:28:44,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 239 transitions, 3610 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:44,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:28:44,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:28:44,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:46,713 INFO L124 PetriNetUnfolderBase]: 3053/5128 cut-off events. [2024-06-28 00:28:46,713 INFO L125 PetriNetUnfolderBase]: For 86957/86974 co-relation queries the response was YES. [2024-06-28 00:28:46,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29784 conditions, 5128 events. 3053/5128 cut-off events. For 86957/86974 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 33291 event pairs, 852 based on Foata normal form. 15/5139 useless extension candidates. Maximal degree in co-relation 29716. Up to 3149 conditions per place. [2024-06-28 00:28:46,756 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 171 selfloop transitions, 100 changer transitions 0/276 dead transitions. [2024-06-28 00:28:46,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 276 transitions, 4314 flow [2024-06-28 00:28:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:28:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:28:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 00:28:46,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-28 00:28:46,758 INFO L175 Difference]: Start difference. First operand has 153 places, 239 transitions, 3610 flow. Second operand 9 states and 155 transitions. [2024-06-28 00:28:46,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 276 transitions, 4314 flow [2024-06-28 00:28:46,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 276 transitions, 4125 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-28 00:28:46,910 INFO L231 Difference]: Finished difference. Result has 156 places, 239 transitions, 3619 flow [2024-06-28 00:28:46,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3375, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3619, PETRI_PLACES=156, PETRI_TRANSITIONS=239} [2024-06-28 00:28:46,910 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-28 00:28:46,911 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 239 transitions, 3619 flow [2024-06-28 00:28:46,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-06-28 00:28:46,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:46,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:46,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 00:28:46,912 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:46,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash 213063788, now seen corresponding path program 1 times [2024-06-28 00:28:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180727151] [2024-06-28 00:28:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:46,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:28:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:28:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:28:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180727151] [2024-06-28 00:28:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180727151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:28:49,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:28:49,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:28:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514193919] [2024-06-28 00:28:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:28:49,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:28:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:28:49,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:28:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:28:49,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:28:49,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 239 transitions, 3619 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-06-28 00:28:49,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:28:49,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:28:49,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:50,673 INFO L124 PetriNetUnfolderBase]: 3055/5155 cut-off events. [2024-06-28 00:28:50,673 INFO L125 PetriNetUnfolderBase]: For 89491/89514 co-relation queries the response was YES. [2024-06-28 00:28:50,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30056 conditions, 5155 events. 3055/5155 cut-off events. For 89491/89514 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 34290 event pairs, 1192 based on Foata normal form. 20/5172 useless extension candidates. Maximal degree in co-relation 29987. Up to 4699 conditions per place. [2024-06-28 00:28:50,719 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 213 selfloop transitions, 51 changer transitions 0/269 dead transitions. [2024-06-28 00:28:50,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 269 transitions, 4456 flow [2024-06-28 00:28:50,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:28:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:28:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-28 00:28:50,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-28 00:28:50,720 INFO L175 Difference]: Start difference. First operand has 156 places, 239 transitions, 3619 flow. Second operand 6 states and 106 transitions. [2024-06-28 00:28:50,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 269 transitions, 4456 flow [2024-06-28 00:28:50,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 269 transitions, 4228 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-28 00:28:50,959 INFO L231 Difference]: Finished difference. Result has 156 places, 249 transitions, 3694 flow [2024-06-28 00:28:50,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3391, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3694, PETRI_PLACES=156, PETRI_TRANSITIONS=249} [2024-06-28 00:28:50,960 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-28 00:28:50,960 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 249 transitions, 3694 flow [2024-06-28 00:28:50,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-06-28 00:28:50,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:50,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:50,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 00:28:50,961 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:50,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash 619117102, now seen corresponding path program 1 times [2024-06-28 00:28:50,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:50,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804744065] [2024-06-28 00:28:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:50,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:28:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:28:54,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:28:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804744065] [2024-06-28 00:28:54,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804744065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:28:54,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:28:54,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:28:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635204191] [2024-06-28 00:28:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:28:54,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:28:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:28:54,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:28:54,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:28:54,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-28 00:28:54,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 249 transitions, 3694 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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-06-28 00:28:54,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:28:54,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-28 00:28:54,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:28:55,842 INFO L124 PetriNetUnfolderBase]: 2894/4871 cut-off events. [2024-06-28 00:28:55,842 INFO L125 PetriNetUnfolderBase]: For 91702/91821 co-relation queries the response was YES. [2024-06-28 00:28:55,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28743 conditions, 4871 events. 2894/4871 cut-off events. For 91702/91821 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 32660 event pairs, 1320 based on Foata normal form. 108/4928 useless extension candidates. Maximal degree in co-relation 28671. Up to 4465 conditions per place. [2024-06-28 00:28:55,890 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 214 selfloop transitions, 15 changer transitions 0/263 dead transitions. [2024-06-28 00:28:55,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 263 transitions, 4233 flow [2024-06-28 00:28:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:28:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:28:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-28 00:28:55,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-28 00:28:55,892 INFO L175 Difference]: Start difference. First operand has 156 places, 249 transitions, 3694 flow. Second operand 6 states and 101 transitions. [2024-06-28 00:28:55,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 263 transitions, 4233 flow [2024-06-28 00:28:56,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 263 transitions, 4201 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-06-28 00:28:56,056 INFO L231 Difference]: Finished difference. Result has 161 places, 252 transitions, 3745 flow [2024-06-28 00:28:56,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3662, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3745, PETRI_PLACES=161, PETRI_TRANSITIONS=252} [2024-06-28 00:28:56,056 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 119 predicate places. [2024-06-28 00:28:56,056 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 252 transitions, 3745 flow [2024-06-28 00:28:56,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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-06-28 00:28:56,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:28:56,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:28:56,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 00:28:56,057 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:28:56,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:28:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2098605994, now seen corresponding path program 1 times [2024-06-28 00:28:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:28:56,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317456633] [2024-06-28 00:28:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:28:56,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:28:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:00,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:00,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317456633] [2024-06-28 00:29:00,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317456633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:00,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:00,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:29:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794340291] [2024-06-28 00:29:00,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:00,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:29:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:29:00,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:29:00,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-28 00:29:00,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 252 transitions, 3745 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-06-28 00:29:00,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:00,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-28 00:29:00,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:02,212 INFO L124 PetriNetUnfolderBase]: 2962/5005 cut-off events. [2024-06-28 00:29:02,213 INFO L125 PetriNetUnfolderBase]: For 94725/94761 co-relation queries the response was YES. [2024-06-28 00:29:02,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29857 conditions, 5005 events. 2962/5005 cut-off events. For 94725/94761 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 33273 event pairs, 875 based on Foata normal form. 29/4978 useless extension candidates. Maximal degree in co-relation 29781. Up to 4431 conditions per place. [2024-06-28 00:29:02,262 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 194 selfloop transitions, 60 changer transitions 0/288 dead transitions. [2024-06-28 00:29:02,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 288 transitions, 4580 flow [2024-06-28 00:29:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:29:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:29:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-28 00:29:02,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-28 00:29:02,264 INFO L175 Difference]: Start difference. First operand has 161 places, 252 transitions, 3745 flow. Second operand 8 states and 139 transitions. [2024-06-28 00:29:02,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 288 transitions, 4580 flow [2024-06-28 00:29:02,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 288 transitions, 4540 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 00:29:02,441 INFO L231 Difference]: Finished difference. Result has 164 places, 267 transitions, 4048 flow [2024-06-28 00:29:02,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3705, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4048, PETRI_PLACES=164, PETRI_TRANSITIONS=267} [2024-06-28 00:29:02,442 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 122 predicate places. [2024-06-28 00:29:02,442 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 267 transitions, 4048 flow [2024-06-28 00:29:02,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-06-28 00:29:02,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:02,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:02,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 00:29:02,442 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:02,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2012362694, now seen corresponding path program 2 times [2024-06-28 00:29:02,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:02,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917403076] [2024-06-28 00:29:02,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:02,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:06,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917403076] [2024-06-28 00:29:06,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917403076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:06,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:06,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:29:06,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193877828] [2024-06-28 00:29:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:06,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:29:06,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:06,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:29:06,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:29:06,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-28 00:29:06,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 267 transitions, 4048 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-06-28 00:29:06,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:06,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-28 00:29:06,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:08,197 INFO L124 PetriNetUnfolderBase]: 2957/4980 cut-off events. [2024-06-28 00:29:08,197 INFO L125 PetriNetUnfolderBase]: For 99982/100021 co-relation queries the response was YES. [2024-06-28 00:29:08,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30065 conditions, 4980 events. 2957/4980 cut-off events. For 99982/100021 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 32956 event pairs, 874 based on Foata normal form. 29/4947 useless extension candidates. Maximal degree in co-relation 29988. Up to 4455 conditions per place. [2024-06-28 00:29:08,242 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 191 selfloop transitions, 58 changer transitions 0/283 dead transitions. [2024-06-28 00:29:08,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 283 transitions, 4676 flow [2024-06-28 00:29:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:29:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:29:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-28 00:29:08,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-28 00:29:08,244 INFO L175 Difference]: Start difference. First operand has 164 places, 267 transitions, 4048 flow. Second operand 8 states and 130 transitions. [2024-06-28 00:29:08,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 283 transitions, 4676 flow [2024-06-28 00:29:08,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 283 transitions, 4607 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-06-28 00:29:08,436 INFO L231 Difference]: Finished difference. Result has 170 places, 270 transitions, 4140 flow [2024-06-28 00:29:08,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3979, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4140, PETRI_PLACES=170, PETRI_TRANSITIONS=270} [2024-06-28 00:29:08,436 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 128 predicate places. [2024-06-28 00:29:08,437 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 270 transitions, 4140 flow [2024-06-28 00:29:08,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-06-28 00:29:08,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:08,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:08,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 00:29:08,437 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:08,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1597164194, now seen corresponding path program 3 times [2024-06-28 00:29:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:08,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435180531] [2024-06-28 00:29:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:12,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:12,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435180531] [2024-06-28 00:29:12,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435180531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:12,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:12,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:29:12,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234892518] [2024-06-28 00:29:12,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:12,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:29:12,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:12,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:29:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:29:12,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-28 00:29:12,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 270 transitions, 4140 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-06-28 00:29:12,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:12,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-28 00:29:12,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:14,035 INFO L124 PetriNetUnfolderBase]: 2937/4960 cut-off events. [2024-06-28 00:29:14,035 INFO L125 PetriNetUnfolderBase]: For 103519/103547 co-relation queries the response was YES. [2024-06-28 00:29:14,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30145 conditions, 4960 events. 2937/4960 cut-off events. For 103519/103547 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 32985 event pairs, 866 based on Foata normal form. 24/4933 useless extension candidates. Maximal degree in co-relation 30066. Up to 4379 conditions per place. [2024-06-28 00:29:14,080 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 185 selfloop transitions, 78 changer transitions 0/297 dead transitions. [2024-06-28 00:29:14,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 297 transitions, 4846 flow [2024-06-28 00:29:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:29:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:29:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-28 00:29:14,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3975609756097561 [2024-06-28 00:29:14,081 INFO L175 Difference]: Start difference. First operand has 170 places, 270 transitions, 4140 flow. Second operand 10 states and 163 transitions. [2024-06-28 00:29:14,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 297 transitions, 4846 flow [2024-06-28 00:29:14,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 297 transitions, 4670 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 00:29:14,346 INFO L231 Difference]: Finished difference. Result has 173 places, 273 transitions, 4163 flow [2024-06-28 00:29:14,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3964, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4163, PETRI_PLACES=173, PETRI_TRANSITIONS=273} [2024-06-28 00:29:14,347 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places. [2024-06-28 00:29:14,347 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 273 transitions, 4163 flow [2024-06-28 00:29:14,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-06-28 00:29:14,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:14,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:14,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 00:29:14,348 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:14,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1984955672, now seen corresponding path program 1 times [2024-06-28 00:29:14,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:14,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338412163] [2024-06-28 00:29:14,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:17,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338412163] [2024-06-28 00:29:17,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338412163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:17,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:17,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:29:17,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335280270] [2024-06-28 00:29:17,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:17,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:29:17,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:17,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:29:17,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:29:17,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:29:17,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 273 transitions, 4163 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-06-28 00:29:17,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:17,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:29:17,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:19,023 INFO L124 PetriNetUnfolderBase]: 3092/5166 cut-off events. [2024-06-28 00:29:19,023 INFO L125 PetriNetUnfolderBase]: For 111345/111345 co-relation queries the response was YES. [2024-06-28 00:29:19,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31802 conditions, 5166 events. 3092/5166 cut-off events. For 111345/111345 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 34049 event pairs, 1401 based on Foata normal form. 1/5159 useless extension candidates. Maximal degree in co-relation 31724. Up to 4842 conditions per place. [2024-06-28 00:29:19,067 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 270 selfloop transitions, 30 changer transitions 0/305 dead transitions. [2024-06-28 00:29:19,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 305 transitions, 5127 flow [2024-06-28 00:29:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:29:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:29:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 00:29:19,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-28 00:29:19,069 INFO L175 Difference]: Start difference. First operand has 173 places, 273 transitions, 4163 flow. Second operand 7 states and 120 transitions. [2024-06-28 00:29:19,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 305 transitions, 5127 flow [2024-06-28 00:29:19,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 305 transitions, 5030 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 00:29:19,245 INFO L231 Difference]: Finished difference. Result has 177 places, 285 transitions, 4327 flow [2024-06-28 00:29:19,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4066, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4327, PETRI_PLACES=177, PETRI_TRANSITIONS=285} [2024-06-28 00:29:19,246 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-28 00:29:19,246 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 285 transitions, 4327 flow [2024-06-28 00:29:19,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-06-28 00:29:19,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:19,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:19,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 00:29:19,246 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:19,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2012762532, now seen corresponding path program 1 times [2024-06-28 00:29:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:19,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170310795] [2024-06-28 00:29:19,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:19,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:23,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170310795] [2024-06-28 00:29:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170310795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:23,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:29:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914303848] [2024-06-28 00:29:23,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:23,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:29:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:29:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:29:23,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-28 00:29:23,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 285 transitions, 4327 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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-06-28 00:29:23,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:23,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-28 00:29:23,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:24,466 INFO L124 PetriNetUnfolderBase]: 2924/4924 cut-off events. [2024-06-28 00:29:24,467 INFO L125 PetriNetUnfolderBase]: For 116874/116979 co-relation queries the response was YES. [2024-06-28 00:29:24,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30794 conditions, 4924 events. 2924/4924 cut-off events. For 116874/116979 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 32815 event pairs, 1324 based on Foata normal form. 101/4979 useless extension candidates. Maximal degree in co-relation 30713. Up to 4500 conditions per place. [2024-06-28 00:29:24,511 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 248 selfloop transitions, 17 changer transitions 0/299 dead transitions. [2024-06-28 00:29:24,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 299 transitions, 4921 flow [2024-06-28 00:29:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:29:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:29:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-28 00:29:24,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-28 00:29:24,513 INFO L175 Difference]: Start difference. First operand has 177 places, 285 transitions, 4327 flow. Second operand 8 states and 123 transitions. [2024-06-28 00:29:24,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 299 transitions, 4921 flow [2024-06-28 00:29:24,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 299 transitions, 4868 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-28 00:29:24,726 INFO L231 Difference]: Finished difference. Result has 183 places, 286 transitions, 4331 flow [2024-06-28 00:29:24,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4274, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4331, PETRI_PLACES=183, PETRI_TRANSITIONS=286} [2024-06-28 00:29:24,727 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2024-06-28 00:29:24,727 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 286 transitions, 4331 flow [2024-06-28 00:29:24,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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-06-28 00:29:24,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:24,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:24,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 00:29:24,728 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:24,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:24,729 INFO L85 PathProgramCache]: Analyzing trace with hash -741585857, now seen corresponding path program 1 times [2024-06-28 00:29:24,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:24,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375160295] [2024-06-28 00:29:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:24,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375160295] [2024-06-28 00:29:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375160295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:28,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:28,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:29:28,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627371812] [2024-06-28 00:29:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:28,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:29:28,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:29:28,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:29:28,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-28 00:29:28,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 286 transitions, 4331 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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-06-28 00:29:28,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:28,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-28 00:29:28,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:30,074 INFO L124 PetriNetUnfolderBase]: 2918/4924 cut-off events. [2024-06-28 00:29:30,074 INFO L125 PetriNetUnfolderBase]: For 117814/117836 co-relation queries the response was YES. [2024-06-28 00:29:30,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30911 conditions, 4924 events. 2918/4924 cut-off events. For 117814/117836 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 32520 event pairs, 883 based on Foata normal form. 22/4890 useless extension candidates. Maximal degree in co-relation 30827. Up to 4368 conditions per place. [2024-06-28 00:29:30,113 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 187 selfloop transitions, 75 changer transitions 0/296 dead transitions. [2024-06-28 00:29:30,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 296 transitions, 4889 flow [2024-06-28 00:29:30,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:29:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:29:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-28 00:29:30,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-28 00:29:30,115 INFO L175 Difference]: Start difference. First operand has 183 places, 286 transitions, 4331 flow. Second operand 7 states and 114 transitions. [2024-06-28 00:29:30,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 296 transitions, 4889 flow [2024-06-28 00:29:30,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 296 transitions, 4802 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-28 00:29:30,309 INFO L231 Difference]: Finished difference. Result has 184 places, 286 transitions, 4427 flow [2024-06-28 00:29:30,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4244, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4427, PETRI_PLACES=184, PETRI_TRANSITIONS=286} [2024-06-28 00:29:30,310 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places. [2024-06-28 00:29:30,310 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 286 transitions, 4427 flow [2024-06-28 00:29:30,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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-06-28 00:29:30,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:30,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:30,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 00:29:30,311 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:30,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:30,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1138369711, now seen corresponding path program 1 times [2024-06-28 00:29:30,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:30,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185026264] [2024-06-28 00:29:30,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:30,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185026264] [2024-06-28 00:29:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185026264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:34,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:34,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:29:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489098001] [2024-06-28 00:29:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:34,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:29:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:29:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:29:34,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:29:34,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 286 transitions, 4427 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-06-28 00:29:34,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:34,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:29:34,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:36,424 INFO L124 PetriNetUnfolderBase]: 3090/5192 cut-off events. [2024-06-28 00:29:36,424 INFO L125 PetriNetUnfolderBase]: For 123242/123248 co-relation queries the response was YES. [2024-06-28 00:29:36,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32772 conditions, 5192 events. 3090/5192 cut-off events. For 123242/123248 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 34055 event pairs, 931 based on Foata normal form. 2/5189 useless extension candidates. Maximal degree in co-relation 32687. Up to 4750 conditions per place. [2024-06-28 00:29:36,464 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 244 selfloop transitions, 62 changer transitions 0/311 dead transitions. [2024-06-28 00:29:36,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 311 transitions, 5224 flow [2024-06-28 00:29:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:29:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:29:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-28 00:29:36,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-28 00:29:36,466 INFO L175 Difference]: Start difference. First operand has 184 places, 286 transitions, 4427 flow. Second operand 8 states and 130 transitions. [2024-06-28 00:29:36,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 311 transitions, 5224 flow [2024-06-28 00:29:36,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 311 transitions, 5094 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 00:29:36,667 INFO L231 Difference]: Finished difference. Result has 187 places, 294 transitions, 4575 flow [2024-06-28 00:29:36,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4297, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4575, PETRI_PLACES=187, PETRI_TRANSITIONS=294} [2024-06-28 00:29:36,668 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 145 predicate places. [2024-06-28 00:29:36,668 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 294 transitions, 4575 flow [2024-06-28 00:29:36,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-06-28 00:29:36,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:36,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:36,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 00:29:36,668 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:36,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1351311327, now seen corresponding path program 2 times [2024-06-28 00:29:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665297626] [2024-06-28 00:29:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:40,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:40,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665297626] [2024-06-28 00:29:40,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665297626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:40,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:40,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:29:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128090466] [2024-06-28 00:29:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:40,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:29:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:40,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:29:40,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:29:40,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:29:40,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 294 transitions, 4575 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-06-28 00:29:40,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:40,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:29:40,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:42,994 INFO L124 PetriNetUnfolderBase]: 3087/5183 cut-off events. [2024-06-28 00:29:42,994 INFO L125 PetriNetUnfolderBase]: For 120543/120554 co-relation queries the response was YES. [2024-06-28 00:29:43,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32558 conditions, 5183 events. 3087/5183 cut-off events. For 120543/120554 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 33960 event pairs, 924 based on Foata normal form. 2/5179 useless extension candidates. Maximal degree in co-relation 32472. Up to 4724 conditions per place. [2024-06-28 00:29:43,035 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 229 selfloop transitions, 83 changer transitions 0/317 dead transitions. [2024-06-28 00:29:43,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 317 transitions, 5453 flow [2024-06-28 00:29:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:29:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:29:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-28 00:29:43,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-28 00:29:43,037 INFO L175 Difference]: Start difference. First operand has 187 places, 294 transitions, 4575 flow. Second operand 9 states and 142 transitions. [2024-06-28 00:29:43,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 317 transitions, 5453 flow [2024-06-28 00:29:43,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 317 transitions, 5312 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-28 00:29:43,242 INFO L231 Difference]: Finished difference. Result has 191 places, 302 transitions, 4787 flow [2024-06-28 00:29:43,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4434, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4787, PETRI_PLACES=191, PETRI_TRANSITIONS=302} [2024-06-28 00:29:43,242 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2024-06-28 00:29:43,242 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 302 transitions, 4787 flow [2024-06-28 00:29:43,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-06-28 00:29:43,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:43,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:43,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 00:29:43,243 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:43,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1879126365, now seen corresponding path program 3 times [2024-06-28 00:29:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929399790] [2024-06-28 00:29:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:47,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:47,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929399790] [2024-06-28 00:29:47,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929399790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:47,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:47,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:29:47,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738455666] [2024-06-28 00:29:47,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:47,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:29:47,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:47,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:29:47,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:29:47,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:29:47,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 302 transitions, 4787 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-06-28 00:29:47,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:47,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:29:47,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:48,609 INFO L124 PetriNetUnfolderBase]: 3084/5175 cut-off events. [2024-06-28 00:29:48,610 INFO L125 PetriNetUnfolderBase]: For 125673/125684 co-relation queries the response was YES. [2024-06-28 00:29:48,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32858 conditions, 5175 events. 3084/5175 cut-off events. For 125673/125684 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 33853 event pairs, 938 based on Foata normal form. 2/5171 useless extension candidates. Maximal degree in co-relation 32770. Up to 4721 conditions per place. [2024-06-28 00:29:48,651 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 226 selfloop transitions, 82 changer transitions 0/313 dead transitions. [2024-06-28 00:29:48,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 313 transitions, 5439 flow [2024-06-28 00:29:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:29:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:29:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-28 00:29:48,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-28 00:29:48,653 INFO L175 Difference]: Start difference. First operand has 191 places, 302 transitions, 4787 flow. Second operand 8 states and 123 transitions. [2024-06-28 00:29:48,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 313 transitions, 5439 flow [2024-06-28 00:29:48,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 313 transitions, 5186 flow, removed 64 selfloop flow, removed 5 redundant places. [2024-06-28 00:29:48,887 INFO L231 Difference]: Finished difference. Result has 194 places, 302 transitions, 4704 flow [2024-06-28 00:29:48,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4534, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4704, PETRI_PLACES=194, PETRI_TRANSITIONS=302} [2024-06-28 00:29:48,888 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places. [2024-06-28 00:29:48,888 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 302 transitions, 4704 flow [2024-06-28 00:29:48,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-06-28 00:29:48,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:48,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:48,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 00:29:48,888 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:48,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1997266559, now seen corresponding path program 1 times [2024-06-28 00:29:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:48,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500937633] [2024-06-28 00:29:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:51,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500937633] [2024-06-28 00:29:51,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500937633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:51,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:51,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:29:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125581592] [2024-06-28 00:29:51,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:51,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:29:51,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:29:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:29:51,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:29:51,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 302 transitions, 4704 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-06-28 00:29:51,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:51,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:29:51,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:53,527 INFO L124 PetriNetUnfolderBase]: 3100/5205 cut-off events. [2024-06-28 00:29:53,527 INFO L125 PetriNetUnfolderBase]: For 134516/134533 co-relation queries the response was YES. [2024-06-28 00:29:53,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33081 conditions, 5205 events. 3100/5205 cut-off events. For 134516/134533 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 34325 event pairs, 1056 based on Foata normal form. 18/5220 useless extension candidates. Maximal degree in co-relation 32993. Up to 4506 conditions per place. [2024-06-28 00:29:53,569 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 257 selfloop transitions, 76 changer transitions 0/338 dead transitions. [2024-06-28 00:29:53,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 338 transitions, 5732 flow [2024-06-28 00:29:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:29:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:29:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 00:29:53,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-28 00:29:53,570 INFO L175 Difference]: Start difference. First operand has 194 places, 302 transitions, 4704 flow. Second operand 8 states and 132 transitions. [2024-06-28 00:29:53,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 338 transitions, 5732 flow [2024-06-28 00:29:53,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 338 transitions, 5562 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-28 00:29:53,782 INFO L231 Difference]: Finished difference. Result has 196 places, 308 transitions, 4847 flow [2024-06-28 00:29:53,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4534, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4847, PETRI_PLACES=196, PETRI_TRANSITIONS=308} [2024-06-28 00:29:53,782 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-28 00:29:53,782 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 308 transitions, 4847 flow [2024-06-28 00:29:53,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-06-28 00:29:53,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:53,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:53,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 00:29:53,783 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:53,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1994409599, now seen corresponding path program 2 times [2024-06-28 00:29:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117750958] [2024-06-28 00:29:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:29:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:29:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:29:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117750958] [2024-06-28 00:29:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117750958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:29:56,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:29:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:29:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611002781] [2024-06-28 00:29:56,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:29:56,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:29:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:29:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:29:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:29:57,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:29:57,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 308 transitions, 4847 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-06-28 00:29:57,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:29:57,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:29:57,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:29:58,713 INFO L124 PetriNetUnfolderBase]: 3103/5214 cut-off events. [2024-06-28 00:29:58,713 INFO L125 PetriNetUnfolderBase]: For 141406/141423 co-relation queries the response was YES. [2024-06-28 00:29:58,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33686 conditions, 5214 events. 3103/5214 cut-off events. For 141406/141423 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 34551 event pairs, 1190 based on Foata normal form. 18/5229 useless extension candidates. Maximal degree in co-relation 33596. Up to 4752 conditions per place. [2024-06-28 00:29:58,764 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 261 selfloop transitions, 65 changer transitions 0/331 dead transitions. [2024-06-28 00:29:58,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 331 transitions, 5660 flow [2024-06-28 00:29:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:29:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:29:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-28 00:29:58,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-28 00:29:58,767 INFO L175 Difference]: Start difference. First operand has 196 places, 308 transitions, 4847 flow. Second operand 8 states and 126 transitions. [2024-06-28 00:29:58,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 331 transitions, 5660 flow [2024-06-28 00:29:59,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 331 transitions, 5579 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-28 00:29:59,010 INFO L231 Difference]: Finished difference. Result has 201 places, 310 transitions, 4950 flow [2024-06-28 00:29:59,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4778, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4950, PETRI_PLACES=201, PETRI_TRANSITIONS=310} [2024-06-28 00:29:59,011 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-06-28 00:29:59,011 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 310 transitions, 4950 flow [2024-06-28 00:29:59,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-06-28 00:29:59,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:29:59,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:29:59,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 00:29:59,011 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:29:59,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:29:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1404082165, now seen corresponding path program 1 times [2024-06-28 00:29:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:29:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093734288] [2024-06-28 00:29:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:29:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:29:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:30:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:30:02,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:30:02,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093734288] [2024-06-28 00:30:02,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093734288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:30:02,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:30:02,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:30:02,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668448819] [2024-06-28 00:30:02,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:30:02,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:30:02,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:30:02,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:30:02,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:30:02,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:30:02,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 310 transitions, 4950 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:02,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:30:02,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:30:02,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:30:04,438 INFO L124 PetriNetUnfolderBase]: 3100/5182 cut-off events. [2024-06-28 00:30:04,439 INFO L125 PetriNetUnfolderBase]: For 145014/145014 co-relation queries the response was YES. [2024-06-28 00:30:04,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33814 conditions, 5182 events. 3100/5182 cut-off events. For 145014/145014 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 34229 event pairs, 1392 based on Foata normal form. 1/5175 useless extension candidates. Maximal degree in co-relation 33722. Up to 4858 conditions per place. [2024-06-28 00:30:04,485 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 294 selfloop transitions, 31 changer transitions 0/330 dead transitions. [2024-06-28 00:30:04,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 330 transitions, 5772 flow [2024-06-28 00:30:04,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:30:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:30:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-28 00:30:04,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-28 00:30:04,487 INFO L175 Difference]: Start difference. First operand has 201 places, 310 transitions, 4950 flow. Second operand 7 states and 119 transitions. [2024-06-28 00:30:04,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 330 transitions, 5772 flow [2024-06-28 00:30:04,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 330 transitions, 5558 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-28 00:30:04,743 INFO L231 Difference]: Finished difference. Result has 201 places, 311 transitions, 4820 flow [2024-06-28 00:30:04,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4743, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4820, PETRI_PLACES=201, PETRI_TRANSITIONS=311} [2024-06-28 00:30:04,744 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-06-28 00:30:04,744 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 311 transitions, 4820 flow [2024-06-28 00:30:04,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:04,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:30:04,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:30:04,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 00:30:04,745 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:30:04,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:30:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2035544531, now seen corresponding path program 2 times [2024-06-28 00:30:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:30:04,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611446248] [2024-06-28 00:30:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:30:04,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:30:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:30:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:30:08,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:30:08,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611446248] [2024-06-28 00:30:08,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611446248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:30:08,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:30:08,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:30:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183120108] [2024-06-28 00:30:08,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:30:08,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:30:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:30:08,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:30:08,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:30:08,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:30:08,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 311 transitions, 4820 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:08,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:30:08,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:30:08,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:30:10,171 INFO L124 PetriNetUnfolderBase]: 3110/5205 cut-off events. [2024-06-28 00:30:10,172 INFO L125 PetriNetUnfolderBase]: For 148979/148979 co-relation queries the response was YES. [2024-06-28 00:30:10,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33900 conditions, 5205 events. 3110/5205 cut-off events. For 148979/148979 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 34410 event pairs, 1388 based on Foata normal form. 1/5198 useless extension candidates. Maximal degree in co-relation 33807. Up to 4888 conditions per place. [2024-06-28 00:30:10,228 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 300 selfloop transitions, 27 changer transitions 0/332 dead transitions. [2024-06-28 00:30:10,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 332 transitions, 5722 flow [2024-06-28 00:30:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:30:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:30:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-28 00:30:10,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36890243902439024 [2024-06-28 00:30:10,230 INFO L175 Difference]: Start difference. First operand has 201 places, 311 transitions, 4820 flow. Second operand 8 states and 121 transitions. [2024-06-28 00:30:10,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 332 transitions, 5722 flow [2024-06-28 00:30:10,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 332 transitions, 5658 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 00:30:10,496 INFO L231 Difference]: Finished difference. Result has 206 places, 317 transitions, 4935 flow [2024-06-28 00:30:10,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4766, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4935, PETRI_PLACES=206, PETRI_TRANSITIONS=317} [2024-06-28 00:30:10,497 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2024-06-28 00:30:10,497 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 317 transitions, 4935 flow [2024-06-28 00:30:10,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:10,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:30:10,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:30:10,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 00:30:10,498 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:30:10,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:30:10,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2027094353, now seen corresponding path program 3 times [2024-06-28 00:30:10,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:30:10,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128784627] [2024-06-28 00:30:10,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:30:10,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:30:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:30:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:30:14,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:30:14,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128784627] [2024-06-28 00:30:14,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128784627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:30:14,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:30:14,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:30:14,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755798296] [2024-06-28 00:30:14,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:30:14,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:30:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:30:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:30:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:30:14,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:30:14,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 317 transitions, 4935 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-06-28 00:30:14,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:30:14,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:30:14,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:30:16,105 INFO L124 PetriNetUnfolderBase]: 3107/5197 cut-off events. [2024-06-28 00:30:16,105 INFO L125 PetriNetUnfolderBase]: For 153965/153965 co-relation queries the response was YES. [2024-06-28 00:30:16,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33986 conditions, 5197 events. 3107/5197 cut-off events. For 153965/153965 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 34324 event pairs, 1387 based on Foata normal form. 1/5190 useless extension candidates. Maximal degree in co-relation 33890. Up to 4885 conditions per place. [2024-06-28 00:30:16,160 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 300 selfloop transitions, 28 changer transitions 0/333 dead transitions. [2024-06-28 00:30:16,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 333 transitions, 5665 flow [2024-06-28 00:30:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:30:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:30:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2024-06-28 00:30:16,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463414634146341 [2024-06-28 00:30:16,161 INFO L175 Difference]: Start difference. First operand has 206 places, 317 transitions, 4935 flow. Second operand 10 states and 142 transitions. [2024-06-28 00:30:16,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 333 transitions, 5665 flow [2024-06-28 00:30:16,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 333 transitions, 5557 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-28 00:30:16,467 INFO L231 Difference]: Finished difference. Result has 209 places, 317 transitions, 4892 flow [2024-06-28 00:30:16,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4827, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4892, PETRI_PLACES=209, PETRI_TRANSITIONS=317} [2024-06-28 00:30:16,468 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places. [2024-06-28 00:30:16,468 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 317 transitions, 4892 flow [2024-06-28 00:30:16,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-06-28 00:30:16,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:30:16,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:30:16,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 00:30:16,469 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:30:16,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:30:16,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1808947786, now seen corresponding path program 1 times [2024-06-28 00:30:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:30:16,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912469] [2024-06-28 00:30:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:30:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:30:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:30:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:30:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:30:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912469] [2024-06-28 00:30:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:30:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:30:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:30:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122322941] [2024-06-28 00:30:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:30:19,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:30:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:30:19,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:30:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:30:19,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:30:19,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 317 transitions, 4892 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:19,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:30:19,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:30:19,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:30:21,282 INFO L124 PetriNetUnfolderBase]: 3201/5348 cut-off events. [2024-06-28 00:30:21,283 INFO L125 PetriNetUnfolderBase]: For 164847/164847 co-relation queries the response was YES. [2024-06-28 00:30:21,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35326 conditions, 5348 events. 3201/5348 cut-off events. For 164847/164847 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 35147 event pairs, 876 based on Foata normal form. 3/5350 useless extension candidates. Maximal degree in co-relation 35230. Up to 4550 conditions per place. [2024-06-28 00:30:21,329 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 212 selfloop transitions, 167 changer transitions 0/384 dead transitions. [2024-06-28 00:30:21,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 384 transitions, 6331 flow [2024-06-28 00:30:21,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:30:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:30:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-06-28 00:30:21,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44789356984478934 [2024-06-28 00:30:21,331 INFO L175 Difference]: Start difference. First operand has 209 places, 317 transitions, 4892 flow. Second operand 11 states and 202 transitions. [2024-06-28 00:30:21,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 384 transitions, 6331 flow [2024-06-28 00:30:21,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 384 transitions, 6267 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 00:30:21,620 INFO L231 Difference]: Finished difference. Result has 214 places, 336 transitions, 5522 flow [2024-06-28 00:30:21,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4828, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5522, PETRI_PLACES=214, PETRI_TRANSITIONS=336} [2024-06-28 00:30:21,621 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places. [2024-06-28 00:30:21,621 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 336 transitions, 5522 flow [2024-06-28 00:30:21,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:21,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:30:21,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:30:21,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 00:30:21,622 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:30:21,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:30:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1379348782, now seen corresponding path program 2 times [2024-06-28 00:30:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:30:21,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253411300] [2024-06-28 00:30:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:30:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:30:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:30:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:30:24,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:30:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253411300] [2024-06-28 00:30:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253411300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:30:24,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:30:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:30:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311642706] [2024-06-28 00:30:24,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:30:24,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:30:24,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:30:24,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:30:24,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:30:24,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:30:24,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 336 transitions, 5522 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:24,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:30:24,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:30:24,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:30:27,331 INFO L124 PetriNetUnfolderBase]: 3288/5482 cut-off events. [2024-06-28 00:30:27,331 INFO L125 PetriNetUnfolderBase]: For 185352/185352 co-relation queries the response was YES. [2024-06-28 00:30:27,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38428 conditions, 5482 events. 3288/5482 cut-off events. For 185352/185352 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 36075 event pairs, 878 based on Foata normal form. 2/5483 useless extension candidates. Maximal degree in co-relation 38329. Up to 4475 conditions per place. [2024-06-28 00:30:27,392 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 227 selfloop transitions, 174 changer transitions 0/406 dead transitions. [2024-06-28 00:30:27,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 406 transitions, 7155 flow [2024-06-28 00:30:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:30:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:30:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-06-28 00:30:27,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434589800443459 [2024-06-28 00:30:27,394 INFO L175 Difference]: Start difference. First operand has 214 places, 336 transitions, 5522 flow. Second operand 11 states and 200 transitions. [2024-06-28 00:30:27,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 406 transitions, 7155 flow [2024-06-28 00:30:27,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 406 transitions, 6935 flow, removed 54 selfloop flow, removed 5 redundant places. [2024-06-28 00:30:27,793 INFO L231 Difference]: Finished difference. Result has 221 places, 350 transitions, 5961 flow [2024-06-28 00:30:27,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5310, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5961, PETRI_PLACES=221, PETRI_TRANSITIONS=350} [2024-06-28 00:30:27,794 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places. [2024-06-28 00:30:27,794 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 350 transitions, 5961 flow [2024-06-28 00:30:27,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:27,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:30:27,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:30:27,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 00:30:27,795 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:30:27,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:30:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1217074782, now seen corresponding path program 3 times [2024-06-28 00:30:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:30:27,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445571875] [2024-06-28 00:30:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:30:27,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:30:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:30:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:30:31,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:30:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445571875] [2024-06-28 00:30:31,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445571875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:30:31,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:30:31,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:30:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637110852] [2024-06-28 00:30:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:30:31,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:30:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:30:31,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:30:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:30:31,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:30:31,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 350 transitions, 5961 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:31,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:30:31,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:30:31,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:30:33,688 INFO L124 PetriNetUnfolderBase]: 3298/5498 cut-off events. [2024-06-28 00:30:33,688 INFO L125 PetriNetUnfolderBase]: For 196385/196385 co-relation queries the response was YES. [2024-06-28 00:30:33,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39928 conditions, 5498 events. 3298/5498 cut-off events. For 196385/196385 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 36198 event pairs, 889 based on Foata normal form. 2/5499 useless extension candidates. Maximal degree in co-relation 39826. Up to 4483 conditions per place. [2024-06-28 00:30:33,748 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 222 selfloop transitions, 179 changer transitions 0/406 dead transitions. [2024-06-28 00:30:33,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 406 transitions, 7412 flow [2024-06-28 00:30:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:30:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:30:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 209 transitions. [2024-06-28 00:30:33,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4247967479674797 [2024-06-28 00:30:33,750 INFO L175 Difference]: Start difference. First operand has 221 places, 350 transitions, 5961 flow. Second operand 12 states and 209 transitions. [2024-06-28 00:30:33,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 406 transitions, 7412 flow [2024-06-28 00:30:34,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 406 transitions, 7311 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-28 00:30:34,197 INFO L231 Difference]: Finished difference. Result has 229 places, 353 transitions, 6280 flow [2024-06-28 00:30:34,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5878, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6280, PETRI_PLACES=229, PETRI_TRANSITIONS=353} [2024-06-28 00:30:34,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2024-06-28 00:30:34,198 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 353 transitions, 6280 flow [2024-06-28 00:30:34,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:34,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:30:34,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:30:34,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 00:30:34,199 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:30:34,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:30:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1514539200, now seen corresponding path program 4 times [2024-06-28 00:30:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:30:34,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216215196] [2024-06-28 00:30:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:30:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:30:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:30:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:30:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:30:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216215196] [2024-06-28 00:30:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216215196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:30:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:30:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:30:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006988656] [2024-06-28 00:30:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:30:37,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:30:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:30:37,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:30:37,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:30:37,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:30:37,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 353 transitions, 6280 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:37,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:30:37,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:30:37,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:30:39,702 INFO L124 PetriNetUnfolderBase]: 3292/5482 cut-off events. [2024-06-28 00:30:39,703 INFO L125 PetriNetUnfolderBase]: For 203513/203513 co-relation queries the response was YES. [2024-06-28 00:30:39,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40282 conditions, 5482 events. 3292/5482 cut-off events. For 203513/203513 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 36013 event pairs, 901 based on Foata normal form. 2/5481 useless extension candidates. Maximal degree in co-relation 40178. Up to 4908 conditions per place. [2024-06-28 00:30:39,761 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 278 selfloop transitions, 101 changer transitions 0/384 dead transitions. [2024-06-28 00:30:39,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 384 transitions, 7192 flow [2024-06-28 00:30:39,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:30:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:30:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-06-28 00:30:39,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946784922394678 [2024-06-28 00:30:39,763 INFO L175 Difference]: Start difference. First operand has 229 places, 353 transitions, 6280 flow. Second operand 11 states and 178 transitions. [2024-06-28 00:30:39,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 384 transitions, 7192 flow [2024-06-28 00:30:40,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 384 transitions, 6887 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-28 00:30:40,202 INFO L231 Difference]: Finished difference. Result has 232 places, 353 transitions, 6185 flow [2024-06-28 00:30:40,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5975, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6185, PETRI_PLACES=232, PETRI_TRANSITIONS=353} [2024-06-28 00:30:40,202 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 190 predicate places. [2024-06-28 00:30:40,202 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 353 transitions, 6185 flow [2024-06-28 00:30:40,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:30:40,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:30:40,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:30:40,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 00:30:40,203 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:30:40,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:30:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1069249515, now seen corresponding path program 1 times [2024-06-28 00:30:40,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:30:40,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134968743] [2024-06-28 00:30:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:30:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:30:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:30:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:30:44,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:30:44,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134968743] [2024-06-28 00:30:44,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134968743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:30:44,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:30:44,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:30:44,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826438928] [2024-06-28 00:30:44,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:30:44,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:30:44,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:30:44,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:30:44,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:30:44,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-28 00:30:44,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 353 transitions, 6185 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-06-28 00:30:44,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:30:44,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-28 00:30:44,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:30:46,518 INFO L124 PetriNetUnfolderBase]: 3161/5300 cut-off events. [2024-06-28 00:30:46,519 INFO L125 PetriNetUnfolderBase]: For 214711/214731 co-relation queries the response was YES. [2024-06-28 00:30:46,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38810 conditions, 5300 events. 3161/5300 cut-off events. For 214711/214731 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 35110 event pairs, 838 based on Foata normal form. 28/5271 useless extension candidates. Maximal degree in co-relation 38705. Up to 4589 conditions per place. [2024-06-28 00:30:46,575 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 245 selfloop transitions, 79 changer transitions 0/372 dead transitions. [2024-06-28 00:30:46,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 372 transitions, 6966 flow [2024-06-28 00:30:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:30:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:30:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-28 00:30:46,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-28 00:30:46,577 INFO L175 Difference]: Start difference. First operand has 232 places, 353 transitions, 6185 flow. Second operand 8 states and 131 transitions. [2024-06-28 00:30:46,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 372 transitions, 6966 flow [2024-06-28 00:30:46,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 372 transitions, 6727 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-28 00:30:46,978 INFO L231 Difference]: Finished difference. Result has 231 places, 355 transitions, 6160 flow [2024-06-28 00:30:46,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5946, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6160, PETRI_PLACES=231, PETRI_TRANSITIONS=355} [2024-06-28 00:30:46,979 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 189 predicate places. [2024-06-28 00:30:46,979 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 355 transitions, 6160 flow [2024-06-28 00:30:46,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-06-28 00:30:46,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:30:46,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:30:46,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 00:30:46,980 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:30:46,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:30:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash 810444814, now seen corresponding path program 5 times [2024-06-28 00:30:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:30:46,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818613028] [2024-06-28 00:30:46,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:30:46,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:30:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:30:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:30:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:30:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818613028] [2024-06-28 00:30:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818613028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:30:52,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:30:52,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:30:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195280961] [2024-06-28 00:30:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:30:52,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:30:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:30:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:30:52,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:30:52,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:30:52,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 355 transitions, 6160 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:30:52,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:30:52,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:30:52,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:30:54,236 INFO L124 PetriNetUnfolderBase]: 3317/5539 cut-off events. [2024-06-28 00:30:54,236 INFO L125 PetriNetUnfolderBase]: For 213558/213566 co-relation queries the response was YES. [2024-06-28 00:30:54,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40212 conditions, 5539 events. 3317/5539 cut-off events. For 213558/213566 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 36567 event pairs, 948 based on Foata normal form. 5/5539 useless extension candidates. Maximal degree in co-relation 40107. Up to 5038 conditions per place. [2024-06-28 00:30:54,295 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 305 selfloop transitions, 79 changer transitions 0/389 dead transitions. [2024-06-28 00:30:54,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 389 transitions, 7149 flow [2024-06-28 00:30:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:30:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:30:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-28 00:30:54,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-28 00:30:54,297 INFO L175 Difference]: Start difference. First operand has 231 places, 355 transitions, 6160 flow. Second operand 8 states and 143 transitions. [2024-06-28 00:30:54,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 389 transitions, 7149 flow [2024-06-28 00:30:54,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 389 transitions, 6997 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-28 00:30:54,727 INFO L231 Difference]: Finished difference. Result has 233 places, 362 transitions, 6303 flow [2024-06-28 00:30:54,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6008, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6303, PETRI_PLACES=233, PETRI_TRANSITIONS=362} [2024-06-28 00:30:54,728 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 191 predicate places. [2024-06-28 00:30:54,728 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 362 transitions, 6303 flow [2024-06-28 00:30:54,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:30:54,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:30:54,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:30:54,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 00:30:54,729 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:30:54,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:30:54,730 INFO L85 PathProgramCache]: Analyzing trace with hash 673018450, now seen corresponding path program 6 times [2024-06-28 00:30:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:30:54,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66774933] [2024-06-28 00:30:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:30:54,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:30:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:31:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:31:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:31:01,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66774933] [2024-06-28 00:31:01,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66774933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:31:01,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:31:01,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:31:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757080077] [2024-06-28 00:31:01,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:31:01,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:31:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:31:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:31:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:31:01,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:31:01,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 362 transitions, 6303 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:01,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:31:01,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:31:01,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:31:04,089 INFO L124 PetriNetUnfolderBase]: 3363/5584 cut-off events. [2024-06-28 00:31:04,089 INFO L125 PetriNetUnfolderBase]: For 217099/217109 co-relation queries the response was YES. [2024-06-28 00:31:04,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40879 conditions, 5584 events. 3363/5584 cut-off events. For 217099/217109 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 36705 event pairs, 926 based on Foata normal form. 4/5582 useless extension candidates. Maximal degree in co-relation 40773. Up to 4867 conditions per place. [2024-06-28 00:31:04,153 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 259 selfloop transitions, 158 changer transitions 0/422 dead transitions. [2024-06-28 00:31:04,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 422 transitions, 7847 flow [2024-06-28 00:31:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:31:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:31:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 00:31:04,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-28 00:31:04,155 INFO L175 Difference]: Start difference. First operand has 233 places, 362 transitions, 6303 flow. Second operand 8 states and 147 transitions. [2024-06-28 00:31:04,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 422 transitions, 7847 flow [2024-06-28 00:31:04,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 422 transitions, 7638 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-28 00:31:04,734 INFO L231 Difference]: Finished difference. Result has 237 places, 396 transitions, 7007 flow [2024-06-28 00:31:04,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6094, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7007, PETRI_PLACES=237, PETRI_TRANSITIONS=396} [2024-06-28 00:31:04,734 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places. [2024-06-28 00:31:04,734 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 396 transitions, 7007 flow [2024-06-28 00:31:04,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:04,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:31:04,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:31:04,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 00:31:04,735 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:31:04,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:31:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1977531557, now seen corresponding path program 1 times [2024-06-28 00:31:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:31:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805281436] [2024-06-28 00:31:04,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:31:04,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:31:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:31:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:31:09,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:31:09,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805281436] [2024-06-28 00:31:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805281436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:31:09,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:31:09,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:31:09,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185041814] [2024-06-28 00:31:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:31:09,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:31:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:31:09,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:31:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:31:09,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:31:09,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 396 transitions, 7007 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:09,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:31:09,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:31:09,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:31:11,731 INFO L124 PetriNetUnfolderBase]: 3380/5628 cut-off events. [2024-06-28 00:31:11,731 INFO L125 PetriNetUnfolderBase]: For 227949/227965 co-relation queries the response was YES. [2024-06-28 00:31:11,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41864 conditions, 5628 events. 3380/5628 cut-off events. For 227949/227965 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 37458 event pairs, 1197 based on Foata normal form. 17/5641 useless extension candidates. Maximal degree in co-relation 41755. Up to 5077 conditions per place. [2024-06-28 00:31:11,795 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 355 selfloop transitions, 96 changer transitions 0/456 dead transitions. [2024-06-28 00:31:11,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 456 transitions, 8761 flow [2024-06-28 00:31:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:31:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:31:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 00:31:11,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-28 00:31:11,798 INFO L175 Difference]: Start difference. First operand has 237 places, 396 transitions, 7007 flow. Second operand 10 states and 166 transitions. [2024-06-28 00:31:11,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 456 transitions, 8761 flow [2024-06-28 00:31:12,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 456 transitions, 8606 flow, removed 75 selfloop flow, removed 1 redundant places. [2024-06-28 00:31:12,299 INFO L231 Difference]: Finished difference. Result has 248 places, 419 transitions, 7538 flow [2024-06-28 00:31:12,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6852, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7538, PETRI_PLACES=248, PETRI_TRANSITIONS=419} [2024-06-28 00:31:12,300 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 206 predicate places. [2024-06-28 00:31:12,301 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 419 transitions, 7538 flow [2024-06-28 00:31:12,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:12,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:31:12,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:31:12,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 00:31:12,301 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:31:12,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:31:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash -581887852, now seen corresponding path program 7 times [2024-06-28 00:31:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:31:12,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668805541] [2024-06-28 00:31:12,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:31:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:31:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:31:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:31:17,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:31:17,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668805541] [2024-06-28 00:31:17,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668805541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:31:17,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:31:17,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:31:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139474185] [2024-06-28 00:31:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:31:17,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:31:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:31:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:31:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:31:17,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:31:17,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 419 transitions, 7538 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:17,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:31:17,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:31:17,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:31:19,204 INFO L124 PetriNetUnfolderBase]: 3382/5619 cut-off events. [2024-06-28 00:31:19,205 INFO L125 PetriNetUnfolderBase]: For 234148/234158 co-relation queries the response was YES. [2024-06-28 00:31:19,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42262 conditions, 5619 events. 3382/5619 cut-off events. For 234148/234158 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 37008 event pairs, 915 based on Foata normal form. 4/5617 useless extension candidates. Maximal degree in co-relation 42148. Up to 4894 conditions per place. [2024-06-28 00:31:19,267 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 278 selfloop transitions, 162 changer transitions 0/445 dead transitions. [2024-06-28 00:31:19,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 445 transitions, 8714 flow [2024-06-28 00:31:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:31:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:31:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-28 00:31:19,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-28 00:31:19,269 INFO L175 Difference]: Start difference. First operand has 248 places, 419 transitions, 7538 flow. Second operand 8 states and 143 transitions. [2024-06-28 00:31:19,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 445 transitions, 8714 flow [2024-06-28 00:31:19,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 445 transitions, 8348 flow, removed 69 selfloop flow, removed 6 redundant places. [2024-06-28 00:31:19,972 INFO L231 Difference]: Finished difference. Result has 250 places, 422 transitions, 7550 flow [2024-06-28 00:31:19,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7172, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7550, PETRI_PLACES=250, PETRI_TRANSITIONS=422} [2024-06-28 00:31:19,973 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 208 predicate places. [2024-06-28 00:31:19,973 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 422 transitions, 7550 flow [2024-06-28 00:31:19,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:19,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:31:19,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:31:19,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 00:31:19,973 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:31:19,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:31:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash 820896820, now seen corresponding path program 8 times [2024-06-28 00:31:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:31:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318030306] [2024-06-28 00:31:19,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:31:19,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:31:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:31:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:31:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:31:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318030306] [2024-06-28 00:31:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318030306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:31:25,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:31:25,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:31:25,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757286732] [2024-06-28 00:31:25,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:31:25,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:31:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:31:25,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:31:25,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:31:25,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:31:25,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 422 transitions, 7550 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:25,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:31:25,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:31:25,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:31:27,139 INFO L124 PetriNetUnfolderBase]: 3387/5638 cut-off events. [2024-06-28 00:31:27,139 INFO L125 PetriNetUnfolderBase]: For 239724/239730 co-relation queries the response was YES. [2024-06-28 00:31:27,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42236 conditions, 5638 events. 3387/5638 cut-off events. For 239724/239730 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 37144 event pairs, 918 based on Foata normal form. 2/5635 useless extension candidates. Maximal degree in co-relation 42122. Up to 5166 conditions per place. [2024-06-28 00:31:27,201 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 371 selfloop transitions, 67 changer transitions 0/443 dead transitions. [2024-06-28 00:31:27,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 443 transitions, 8541 flow [2024-06-28 00:31:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:31:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:31:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 00:31:27,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-28 00:31:27,203 INFO L175 Difference]: Start difference. First operand has 250 places, 422 transitions, 7550 flow. Second operand 8 states and 134 transitions. [2024-06-28 00:31:27,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 443 transitions, 8541 flow [2024-06-28 00:31:27,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 443 transitions, 8257 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 00:31:27,775 INFO L231 Difference]: Finished difference. Result has 253 places, 425 transitions, 7461 flow [2024-06-28 00:31:27,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7269, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7461, PETRI_PLACES=253, PETRI_TRANSITIONS=425} [2024-06-28 00:31:27,775 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 211 predicate places. [2024-06-28 00:31:27,776 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 425 transitions, 7461 flow [2024-06-28 00:31:27,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:27,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:31:27,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:31:27,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 00:31:27,776 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:31:27,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:31:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 820897161, now seen corresponding path program 2 times [2024-06-28 00:31:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:31:27,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773165869] [2024-06-28 00:31:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:31:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:31:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:31:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:31:34,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:31:34,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773165869] [2024-06-28 00:31:34,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773165869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:31:34,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:31:34,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:31:34,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635507578] [2024-06-28 00:31:34,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:31:34,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:31:34,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:31:34,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:31:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:31:35,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:31:35,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 425 transitions, 7461 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:35,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:31:35,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:31:35,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:31:37,651 INFO L124 PetriNetUnfolderBase]: 3464/5759 cut-off events. [2024-06-28 00:31:37,652 INFO L125 PetriNetUnfolderBase]: For 255659/255665 co-relation queries the response was YES. [2024-06-28 00:31:37,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43424 conditions, 5759 events. 3464/5759 cut-off events. For 255659/255665 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 38061 event pairs, 906 based on Foata normal form. 5/5759 useless extension candidates. Maximal degree in co-relation 43309. Up to 5166 conditions per place. [2024-06-28 00:31:37,711 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 368 selfloop transitions, 104 changer transitions 0/477 dead transitions. [2024-06-28 00:31:37,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 477 transitions, 9151 flow [2024-06-28 00:31:37,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:31:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:31:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2024-06-28 00:31:37,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38802660753880264 [2024-06-28 00:31:37,712 INFO L175 Difference]: Start difference. First operand has 253 places, 425 transitions, 7461 flow. Second operand 11 states and 175 transitions. [2024-06-28 00:31:37,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 477 transitions, 9151 flow [2024-06-28 00:31:38,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 477 transitions, 8993 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-28 00:31:38,477 INFO L231 Difference]: Finished difference. Result has 258 places, 447 transitions, 7978 flow [2024-06-28 00:31:38,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7304, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7978, PETRI_PLACES=258, PETRI_TRANSITIONS=447} [2024-06-28 00:31:38,477 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 216 predicate places. [2024-06-28 00:31:38,477 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 447 transitions, 7978 flow [2024-06-28 00:31:38,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:38,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:31:38,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:31:38,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 00:31:38,478 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:31:38,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:31:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash -578162861, now seen corresponding path program 3 times [2024-06-28 00:31:38,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:31:38,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870063176] [2024-06-28 00:31:38,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:31:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:31:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:31:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:31:43,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:31:43,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870063176] [2024-06-28 00:31:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870063176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:31:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:31:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:31:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274486288] [2024-06-28 00:31:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:31:43,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:31:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:31:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:31:43,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:31:43,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:31:43,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 447 transitions, 7978 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:43,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:31:43,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:31:43,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:31:45,636 INFO L124 PetriNetUnfolderBase]: 3452/5739 cut-off events. [2024-06-28 00:31:45,636 INFO L125 PetriNetUnfolderBase]: For 259398/259404 co-relation queries the response was YES. [2024-06-28 00:31:45,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43376 conditions, 5739 events. 3452/5739 cut-off events. For 259398/259404 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 37877 event pairs, 904 based on Foata normal form. 5/5739 useless extension candidates. Maximal degree in co-relation 43260. Up to 5156 conditions per place. [2024-06-28 00:31:45,703 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 368 selfloop transitions, 104 changer transitions 0/477 dead transitions. [2024-06-28 00:31:45,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 477 transitions, 9143 flow [2024-06-28 00:31:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:31:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:31:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-06-28 00:31:45,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946784922394678 [2024-06-28 00:31:45,705 INFO L175 Difference]: Start difference. First operand has 258 places, 447 transitions, 7978 flow. Second operand 11 states and 178 transitions. [2024-06-28 00:31:45,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 477 transitions, 9143 flow [2024-06-28 00:31:46,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 477 transitions, 9012 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-28 00:31:46,342 INFO L231 Difference]: Finished difference. Result has 263 places, 447 transitions, 8074 flow [2024-06-28 00:31:46,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7847, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8074, PETRI_PLACES=263, PETRI_TRANSITIONS=447} [2024-06-28 00:31:46,342 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 221 predicate places. [2024-06-28 00:31:46,343 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 447 transitions, 8074 flow [2024-06-28 00:31:46,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:46,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:31:46,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:31:46,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 00:31:46,343 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:31:46,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:31:46,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2022410180, now seen corresponding path program 9 times [2024-06-28 00:31:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:31:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459248582] [2024-06-28 00:31:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:31:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:31:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:31:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:31:51,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:31:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459248582] [2024-06-28 00:31:51,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459248582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:31:51,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:31:51,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:31:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872223303] [2024-06-28 00:31:51,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:31:51,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:31:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:31:51,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:31:51,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:31:51,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:31:51,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 447 transitions, 8074 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:51,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:31:51,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:31:51,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:31:53,615 INFO L124 PetriNetUnfolderBase]: 3462/5769 cut-off events. [2024-06-28 00:31:53,615 INFO L125 PetriNetUnfolderBase]: For 268422/268435 co-relation queries the response was YES. [2024-06-28 00:31:53,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43886 conditions, 5769 events. 3462/5769 cut-off events. For 268422/268435 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 38252 event pairs, 886 based on Foata normal form. 5/5770 useless extension candidates. Maximal degree in co-relation 43768. Up to 5003 conditions per place. [2024-06-28 00:31:53,684 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 305 selfloop transitions, 168 changer transitions 0/478 dead transitions. [2024-06-28 00:31:53,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 478 transitions, 9412 flow [2024-06-28 00:31:53,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:31:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:31:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-28 00:31:53,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-28 00:31:53,686 INFO L175 Difference]: Start difference. First operand has 263 places, 447 transitions, 8074 flow. Second operand 8 states and 143 transitions. [2024-06-28 00:31:53,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 478 transitions, 9412 flow [2024-06-28 00:31:54,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 478 transitions, 9159 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-28 00:31:54,344 INFO L231 Difference]: Finished difference. Result has 261 places, 452 transitions, 8262 flow [2024-06-28 00:31:54,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7821, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8262, PETRI_PLACES=261, PETRI_TRANSITIONS=452} [2024-06-28 00:31:54,344 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 219 predicate places. [2024-06-28 00:31:54,344 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 452 transitions, 8262 flow [2024-06-28 00:31:54,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:54,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:31:54,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:31:54,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 00:31:54,345 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:31:54,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:31:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash -902013559, now seen corresponding path program 4 times [2024-06-28 00:31:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:31:54,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178020123] [2024-06-28 00:31:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:31:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:31:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:31:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:31:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:31:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178020123] [2024-06-28 00:31:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178020123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:31:59,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:31:59,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:31:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601991347] [2024-06-28 00:31:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:31:59,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:31:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:31:59,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:31:59,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:31:59,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:31:59,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 452 transitions, 8262 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:31:59,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:31:59,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:31:59,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:32:01,906 INFO L124 PetriNetUnfolderBase]: 3474/5784 cut-off events. [2024-06-28 00:32:01,906 INFO L125 PetriNetUnfolderBase]: For 279357/279372 co-relation queries the response was YES. [2024-06-28 00:32:01,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44349 conditions, 5784 events. 3474/5784 cut-off events. For 279357/279372 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 38569 event pairs, 1199 based on Foata normal form. 15/5796 useless extension candidates. Maximal degree in co-relation 44229. Up to 5263 conditions per place. [2024-06-28 00:32:01,972 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 397 selfloop transitions, 83 changer transitions 0/485 dead transitions. [2024-06-28 00:32:01,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 485 transitions, 9583 flow [2024-06-28 00:32:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:32:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:32:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-28 00:32:01,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-28 00:32:01,974 INFO L175 Difference]: Start difference. First operand has 261 places, 452 transitions, 8262 flow. Second operand 9 states and 148 transitions. [2024-06-28 00:32:01,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 485 transitions, 9583 flow [2024-06-28 00:32:02,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 485 transitions, 9310 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-28 00:32:02,616 INFO L231 Difference]: Finished difference. Result has 266 places, 458 transitions, 8247 flow [2024-06-28 00:32:02,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7998, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8247, PETRI_PLACES=266, PETRI_TRANSITIONS=458} [2024-06-28 00:32:02,617 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 224 predicate places. [2024-06-28 00:32:02,617 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 458 transitions, 8247 flow [2024-06-28 00:32:02,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:02,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:32:02,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:32:02,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 00:32:02,618 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:32:02,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:32:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -902013900, now seen corresponding path program 10 times [2024-06-28 00:32:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:32:02,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748258595] [2024-06-28 00:32:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:32:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:32:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:32:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:32:07,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:32:07,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748258595] [2024-06-28 00:32:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748258595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:32:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:32:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:32:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652023928] [2024-06-28 00:32:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:32:07,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:32:07,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:32:07,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:32:07,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:32:07,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:32:07,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 458 transitions, 8247 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:07,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:32:07,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:32:07,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:32:10,230 INFO L124 PetriNetUnfolderBase]: 3476/5788 cut-off events. [2024-06-28 00:32:10,230 INFO L125 PetriNetUnfolderBase]: For 282386/282397 co-relation queries the response was YES. [2024-06-28 00:32:10,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44207 conditions, 5788 events. 3476/5788 cut-off events. For 282386/282397 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 38327 event pairs, 889 based on Foata normal form. 3/5787 useless extension candidates. Maximal degree in co-relation 44085. Up to 5020 conditions per place. [2024-06-28 00:32:10,298 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 305 selfloop transitions, 173 changer transitions 0/483 dead transitions. [2024-06-28 00:32:10,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 483 transitions, 9532 flow [2024-06-28 00:32:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:32:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:32:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 00:32:10,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-28 00:32:10,300 INFO L175 Difference]: Start difference. First operand has 266 places, 458 transitions, 8247 flow. Second operand 8 states and 140 transitions. [2024-06-28 00:32:10,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 483 transitions, 9532 flow [2024-06-28 00:32:10,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 483 transitions, 9392 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-28 00:32:10,886 INFO L231 Difference]: Finished difference. Result has 270 places, 461 transitions, 8504 flow [2024-06-28 00:32:10,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8107, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8504, PETRI_PLACES=270, PETRI_TRANSITIONS=461} [2024-06-28 00:32:10,886 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places. [2024-06-28 00:32:10,886 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 461 transitions, 8504 flow [2024-06-28 00:32:10,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:10,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:32:10,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:32:10,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 00:32:10,887 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:32:10,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:32:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1697400290, now seen corresponding path program 11 times [2024-06-28 00:32:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:32:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173205838] [2024-06-28 00:32:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:32:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:32:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:32:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:32:15,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:32:15,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173205838] [2024-06-28 00:32:15,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173205838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:32:15,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:32:15,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:32:15,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385660596] [2024-06-28 00:32:15,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:32:15,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:32:15,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:32:15,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:32:15,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:32:15,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:32:15,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 461 transitions, 8504 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:15,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:32:15,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:32:15,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:32:18,113 INFO L124 PetriNetUnfolderBase]: 3481/5791 cut-off events. [2024-06-28 00:32:18,113 INFO L125 PetriNetUnfolderBase]: For 292381/292392 co-relation queries the response was YES. [2024-06-28 00:32:18,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44688 conditions, 5791 events. 3481/5791 cut-off events. For 292381/292392 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 38282 event pairs, 893 based on Foata normal form. 2/5789 useless extension candidates. Maximal degree in co-relation 44564. Up to 5026 conditions per place. [2024-06-28 00:32:18,180 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 287 selfloop transitions, 190 changer transitions 0/482 dead transitions. [2024-06-28 00:32:18,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 482 transitions, 9691 flow [2024-06-28 00:32:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:32:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:32:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 00:32:18,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-28 00:32:18,182 INFO L175 Difference]: Start difference. First operand has 270 places, 461 transitions, 8504 flow. Second operand 8 states and 134 transitions. [2024-06-28 00:32:18,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 482 transitions, 9691 flow [2024-06-28 00:32:18,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 482 transitions, 9252 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-28 00:32:18,816 INFO L231 Difference]: Finished difference. Result has 273 places, 465 transitions, 8520 flow [2024-06-28 00:32:18,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8073, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8520, PETRI_PLACES=273, PETRI_TRANSITIONS=465} [2024-06-28 00:32:18,817 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places. [2024-06-28 00:32:18,817 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 465 transitions, 8520 flow [2024-06-28 00:32:18,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:18,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:32:18,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:32:18,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 00:32:18,817 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:32:18,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:32:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash -577272439, now seen corresponding path program 5 times [2024-06-28 00:32:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:32:18,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089050060] [2024-06-28 00:32:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:32:18,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:32:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:32:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:32:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:32:23,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089050060] [2024-06-28 00:32:23,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089050060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:32:23,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:32:23,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:32:23,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424372411] [2024-06-28 00:32:23,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:32:23,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:32:23,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:32:23,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:32:23,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:32:23,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:32:23,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 465 transitions, 8520 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:23,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:32:23,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:32:23,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:32:26,063 INFO L124 PetriNetUnfolderBase]: 3491/5813 cut-off events. [2024-06-28 00:32:26,063 INFO L125 PetriNetUnfolderBase]: For 302557/302574 co-relation queries the response was YES. [2024-06-28 00:32:26,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44901 conditions, 5813 events. 3491/5813 cut-off events. For 302557/302574 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 38770 event pairs, 1187 based on Foata normal form. 16/5826 useless extension candidates. Maximal degree in co-relation 44776. Up to 5303 conditions per place. [2024-06-28 00:32:26,126 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 401 selfloop transitions, 82 changer transitions 0/488 dead transitions. [2024-06-28 00:32:26,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 488 transitions, 9648 flow [2024-06-28 00:32:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:32:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:32:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-28 00:32:26,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-28 00:32:26,128 INFO L175 Difference]: Start difference. First operand has 273 places, 465 transitions, 8520 flow. Second operand 8 states and 130 transitions. [2024-06-28 00:32:26,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 488 transitions, 9648 flow [2024-06-28 00:32:26,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 488 transitions, 9391 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-28 00:32:26,794 INFO L231 Difference]: Finished difference. Result has 277 places, 468 transitions, 8476 flow [2024-06-28 00:32:26,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8263, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8476, PETRI_PLACES=277, PETRI_TRANSITIONS=468} [2024-06-28 00:32:26,795 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places. [2024-06-28 00:32:26,795 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 468 transitions, 8476 flow [2024-06-28 00:32:26,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:26,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:32:26,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:32:26,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 00:32:26,795 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:32:26,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:32:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash -576886489, now seen corresponding path program 6 times [2024-06-28 00:32:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:32:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814237062] [2024-06-28 00:32:26,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:32:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:32:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:32:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:32:30,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:32:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814237062] [2024-06-28 00:32:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814237062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:32:30,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:32:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:32:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498812991] [2024-06-28 00:32:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:32:30,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:32:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:32:30,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:32:30,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:32:30,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:32:30,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 468 transitions, 8476 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:30,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:32:30,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:32:30,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:32:32,738 INFO L124 PetriNetUnfolderBase]: 3501/5817 cut-off events. [2024-06-28 00:32:32,738 INFO L125 PetriNetUnfolderBase]: For 309282/309290 co-relation queries the response was YES. [2024-06-28 00:32:32,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44920 conditions, 5817 events. 3501/5817 cut-off events. For 309282/309290 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 38855 event pairs, 1174 based on Foata normal form. 10/5826 useless extension candidates. Maximal degree in co-relation 44794. Up to 5142 conditions per place. [2024-06-28 00:32:32,811 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 376 selfloop transitions, 155 changer transitions 0/536 dead transitions. [2024-06-28 00:32:32,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 536 transitions, 10470 flow [2024-06-28 00:32:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:32:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:32:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-06-28 00:32:32,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40447154471544716 [2024-06-28 00:32:32,813 INFO L175 Difference]: Start difference. First operand has 277 places, 468 transitions, 8476 flow. Second operand 12 states and 199 transitions. [2024-06-28 00:32:32,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 536 transitions, 10470 flow [2024-06-28 00:32:33,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 536 transitions, 10360 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 00:32:33,656 INFO L231 Difference]: Finished difference. Result has 288 places, 486 transitions, 9172 flow [2024-06-28 00:32:33,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8366, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9172, PETRI_PLACES=288, PETRI_TRANSITIONS=486} [2024-06-28 00:32:33,656 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 246 predicate places. [2024-06-28 00:32:33,656 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 486 transitions, 9172 flow [2024-06-28 00:32:33,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:33,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:32:33,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:32:33,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 00:32:33,657 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:32:33,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:32:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1145306565, now seen corresponding path program 7 times [2024-06-28 00:32:33,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:32:33,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156847780] [2024-06-28 00:32:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:32:33,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:32:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:32:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:32:38,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:32:38,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156847780] [2024-06-28 00:32:38,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156847780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:32:38,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:32:38,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:32:38,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284453385] [2024-06-28 00:32:38,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:32:38,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:32:38,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:32:38,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:32:38,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:32:38,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:32:38,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 486 transitions, 9172 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:38,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:32:38,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:32:38,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:32:40,867 INFO L124 PetriNetUnfolderBase]: 3547/5891 cut-off events. [2024-06-28 00:32:40,867 INFO L125 PetriNetUnfolderBase]: For 330769/330780 co-relation queries the response was YES. [2024-06-28 00:32:40,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47013 conditions, 5891 events. 3547/5891 cut-off events. For 330769/330780 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 38966 event pairs, 918 based on Foata normal form. 5/5890 useless extension candidates. Maximal degree in co-relation 46882. Up to 5320 conditions per place. [2024-06-28 00:32:40,943 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 408 selfloop transitions, 108 changer transitions 0/521 dead transitions. [2024-06-28 00:32:40,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 521 transitions, 10744 flow [2024-06-28 00:32:40,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:32:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:32:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-06-28 00:32:40,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37915742793791574 [2024-06-28 00:32:40,945 INFO L175 Difference]: Start difference. First operand has 288 places, 486 transitions, 9172 flow. Second operand 11 states and 171 transitions. [2024-06-28 00:32:40,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 521 transitions, 10744 flow [2024-06-28 00:32:41,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 521 transitions, 10576 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-28 00:32:41,771 INFO L231 Difference]: Finished difference. Result has 294 places, 501 transitions, 9598 flow [2024-06-28 00:32:41,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9004, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9598, PETRI_PLACES=294, PETRI_TRANSITIONS=501} [2024-06-28 00:32:41,772 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 252 predicate places. [2024-06-28 00:32:41,772 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 501 transitions, 9598 flow [2024-06-28 00:32:41,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:41,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:32:41,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:32:41,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 00:32:41,773 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:32:41,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:32:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1813495757, now seen corresponding path program 8 times [2024-06-28 00:32:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:32:41,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750558547] [2024-06-28 00:32:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:32:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:32:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:32:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:32:46,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:32:46,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750558547] [2024-06-28 00:32:46,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750558547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:32:46,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:32:46,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:32:46,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738413868] [2024-06-28 00:32:46,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:32:46,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:32:46,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:32:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:32:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:32:46,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:32:46,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 501 transitions, 9598 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:46,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:32:46,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:32:46,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:32:49,249 INFO L124 PetriNetUnfolderBase]: 3535/5879 cut-off events. [2024-06-28 00:32:49,249 INFO L125 PetriNetUnfolderBase]: For 334651/334662 co-relation queries the response was YES. [2024-06-28 00:32:49,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47010 conditions, 5879 events. 3535/5879 cut-off events. For 334651/334662 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 38948 event pairs, 911 based on Foata normal form. 5/5878 useless extension candidates. Maximal degree in co-relation 46877. Up to 5310 conditions per place. [2024-06-28 00:32:49,319 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 410 selfloop transitions, 108 changer transitions 0/523 dead transitions. [2024-06-28 00:32:49,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 523 transitions, 10871 flow [2024-06-28 00:32:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:32:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:32:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 193 transitions. [2024-06-28 00:32:49,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3621013133208255 [2024-06-28 00:32:49,321 INFO L175 Difference]: Start difference. First operand has 294 places, 501 transitions, 9598 flow. Second operand 13 states and 193 transitions. [2024-06-28 00:32:49,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 523 transitions, 10871 flow [2024-06-28 00:32:50,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 523 transitions, 10731 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-28 00:32:50,100 INFO L231 Difference]: Finished difference. Result has 302 places, 501 transitions, 9684 flow [2024-06-28 00:32:50,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9458, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9684, PETRI_PLACES=302, PETRI_TRANSITIONS=501} [2024-06-28 00:32:50,100 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 260 predicate places. [2024-06-28 00:32:50,100 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 501 transitions, 9684 flow [2024-06-28 00:32:50,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:50,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:32:50,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:32:50,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 00:32:50,101 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:32:50,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:32:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1124469458, now seen corresponding path program 12 times [2024-06-28 00:32:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:32:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154567095] [2024-06-28 00:32:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:32:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:32:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:32:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:32:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:32:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154567095] [2024-06-28 00:32:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154567095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:32:54,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:32:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:32:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223886297] [2024-06-28 00:32:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:32:54,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:32:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:32:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:32:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:32:54,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:32:54,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 501 transitions, 9684 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:54,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:32:54,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:32:54,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:32:57,929 INFO L124 PetriNetUnfolderBase]: 3532/5877 cut-off events. [2024-06-28 00:32:57,929 INFO L125 PetriNetUnfolderBase]: For 337704/337715 co-relation queries the response was YES. [2024-06-28 00:32:57,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47261 conditions, 5877 events. 3532/5877 cut-off events. For 337704/337715 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 38978 event pairs, 923 based on Foata normal form. 2/5873 useless extension candidates. Maximal degree in co-relation 47126. Up to 5339 conditions per place. [2024-06-28 00:32:58,000 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 418 selfloop transitions, 94 changer transitions 0/517 dead transitions. [2024-06-28 00:32:58,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 517 transitions, 10884 flow [2024-06-28 00:32:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:32:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:32:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2024-06-28 00:32:58,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3614190687361419 [2024-06-28 00:32:58,002 INFO L175 Difference]: Start difference. First operand has 302 places, 501 transitions, 9684 flow. Second operand 11 states and 163 transitions. [2024-06-28 00:32:58,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 517 transitions, 10884 flow [2024-06-28 00:32:58,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 517 transitions, 10590 flow, removed 23 selfloop flow, removed 12 redundant places. [2024-06-28 00:32:58,848 INFO L231 Difference]: Finished difference. Result has 301 places, 501 transitions, 9584 flow [2024-06-28 00:32:58,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9390, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9584, PETRI_PLACES=301, PETRI_TRANSITIONS=501} [2024-06-28 00:32:58,849 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2024-06-28 00:32:58,849 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 501 transitions, 9584 flow [2024-06-28 00:32:58,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:32:58,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:32:58,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:32:58,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 00:32:58,849 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:32:58,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:32:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash -258679867, now seen corresponding path program 9 times [2024-06-28 00:32:58,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:32:58,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033935987] [2024-06-28 00:32:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:32:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:32:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:33:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:33:02,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:33:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033935987] [2024-06-28 00:33:02,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033935987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:33:02,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:33:02,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:33:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894811511] [2024-06-28 00:33:02,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:33:02,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:33:02,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:33:02,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:33:02,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:33:02,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:33:02,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 501 transitions, 9584 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:02,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:33:02,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:33:02,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:33:05,362 INFO L124 PetriNetUnfolderBase]: 3605/5985 cut-off events. [2024-06-28 00:33:05,362 INFO L125 PetriNetUnfolderBase]: For 357947/357947 co-relation queries the response was YES. [2024-06-28 00:33:05,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48714 conditions, 5985 events. 3605/5985 cut-off events. For 357947/357947 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 39788 event pairs, 887 based on Foata normal form. 2/5984 useless extension candidates. Maximal degree in co-relation 48578. Up to 5159 conditions per place. [2024-06-28 00:33:05,433 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 344 selfloop transitions, 208 changer transitions 0/557 dead transitions. [2024-06-28 00:33:05,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 557 transitions, 11619 flow [2024-06-28 00:33:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:33:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:33:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2024-06-28 00:33:05,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-06-28 00:33:05,434 INFO L175 Difference]: Start difference. First operand has 301 places, 501 transitions, 9584 flow. Second operand 12 states and 194 transitions. [2024-06-28 00:33:05,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 557 transitions, 11619 flow [2024-06-28 00:33:06,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 557 transitions, 11259 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-28 00:33:06,232 INFO L231 Difference]: Finished difference. Result has 303 places, 522 transitions, 10173 flow [2024-06-28 00:33:06,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9224, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10173, PETRI_PLACES=303, PETRI_TRANSITIONS=522} [2024-06-28 00:33:06,233 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 261 predicate places. [2024-06-28 00:33:06,233 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 522 transitions, 10173 flow [2024-06-28 00:33:06,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:06,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:33:06,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:33:06,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 00:33:06,233 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:33:06,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:33:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash -457981657, now seen corresponding path program 10 times [2024-06-28 00:33:06,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:33:06,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236586011] [2024-06-28 00:33:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:33:06,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:33:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:33:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:33:10,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:33:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236586011] [2024-06-28 00:33:10,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236586011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:33:10,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:33:10,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:33:10,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636784382] [2024-06-28 00:33:10,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:33:10,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:33:10,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:33:10,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:33:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:33:10,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:33:10,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 522 transitions, 10173 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:10,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:33:10,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:33:10,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:33:12,409 INFO L124 PetriNetUnfolderBase]: 3599/5973 cut-off events. [2024-06-28 00:33:12,410 INFO L125 PetriNetUnfolderBase]: For 367966/367966 co-relation queries the response was YES. [2024-06-28 00:33:12,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49667 conditions, 5973 events. 3599/5973 cut-off events. For 367966/367966 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 39701 event pairs, 887 based on Foata normal form. 2/5972 useless extension candidates. Maximal degree in co-relation 49529. Up to 5154 conditions per place. [2024-06-28 00:33:12,487 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 347 selfloop transitions, 201 changer transitions 0/553 dead transitions. [2024-06-28 00:33:12,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 553 transitions, 11721 flow [2024-06-28 00:33:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:33:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:33:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 00:33:12,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-28 00:33:12,489 INFO L175 Difference]: Start difference. First operand has 303 places, 522 transitions, 10173 flow. Second operand 10 states and 166 transitions. [2024-06-28 00:33:12,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 553 transitions, 11721 flow [2024-06-28 00:33:13,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 553 transitions, 11327 flow, removed 63 selfloop flow, removed 6 redundant places. [2024-06-28 00:33:13,401 INFO L231 Difference]: Finished difference. Result has 307 places, 522 transitions, 10188 flow [2024-06-28 00:33:13,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9779, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10188, PETRI_PLACES=307, PETRI_TRANSITIONS=522} [2024-06-28 00:33:13,402 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 265 predicate places. [2024-06-28 00:33:13,402 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 522 transitions, 10188 flow [2024-06-28 00:33:13,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:13,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:33:13,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:33:13,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 00:33:13,403 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:33:13,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:33:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1377532773, now seen corresponding path program 11 times [2024-06-28 00:33:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:33:13,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196272996] [2024-06-28 00:33:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:33:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:33:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:33:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:33:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:33:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196272996] [2024-06-28 00:33:18,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196272996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:33:18,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:33:18,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:33:18,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707490025] [2024-06-28 00:33:18,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:33:18,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:33:18,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:33:18,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:33:18,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:33:18,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:33:18,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 522 transitions, 10188 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:18,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:33:18,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:33:18,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:33:20,328 INFO L124 PetriNetUnfolderBase]: 3593/5966 cut-off events. [2024-06-28 00:33:20,328 INFO L125 PetriNetUnfolderBase]: For 375575/375586 co-relation queries the response was YES. [2024-06-28 00:33:20,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49498 conditions, 5966 events. 3593/5966 cut-off events. For 375575/375586 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 39572 event pairs, 921 based on Foata normal form. 3/5963 useless extension candidates. Maximal degree in co-relation 49359. Up to 5434 conditions per place. [2024-06-28 00:33:20,400 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 444 selfloop transitions, 86 changer transitions 0/535 dead transitions. [2024-06-28 00:33:20,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 535 transitions, 11304 flow [2024-06-28 00:33:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:33:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:33:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-28 00:33:20,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3685636856368564 [2024-06-28 00:33:20,402 INFO L175 Difference]: Start difference. First operand has 307 places, 522 transitions, 10188 flow. Second operand 9 states and 136 transitions. [2024-06-28 00:33:20,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 535 transitions, 11304 flow [2024-06-28 00:33:21,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 535 transitions, 10880 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-28 00:33:21,274 INFO L231 Difference]: Finished difference. Result has 309 places, 522 transitions, 9942 flow [2024-06-28 00:33:21,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9764, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9942, PETRI_PLACES=309, PETRI_TRANSITIONS=522} [2024-06-28 00:33:21,275 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 267 predicate places. [2024-06-28 00:33:21,275 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 522 transitions, 9942 flow [2024-06-28 00:33:21,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:21,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:33:21,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:33:21,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 00:33:21,276 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:33:21,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:33:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash -458367948, now seen corresponding path program 13 times [2024-06-28 00:33:21,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:33:21,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230043616] [2024-06-28 00:33:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:33:21,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:33:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:33:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:33:26,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:33:26,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230043616] [2024-06-28 00:33:26,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230043616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:33:26,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:33:26,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:33:26,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741280968] [2024-06-28 00:33:26,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:33:26,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:33:26,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:33:26,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:33:26,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:33:26,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:33:26,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 522 transitions, 9942 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:26,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:33:26,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:33:26,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:33:28,633 INFO L124 PetriNetUnfolderBase]: 3590/5958 cut-off events. [2024-06-28 00:33:28,633 INFO L125 PetriNetUnfolderBase]: For 381213/381224 co-relation queries the response was YES. [2024-06-28 00:33:28,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49114 conditions, 5958 events. 3590/5958 cut-off events. For 381213/381224 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 39406 event pairs, 904 based on Foata normal form. 2/5954 useless extension candidates. Maximal degree in co-relation 48974. Up to 5421 conditions per place. [2024-06-28 00:33:28,713 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 436 selfloop transitions, 93 changer transitions 0/534 dead transitions. [2024-06-28 00:33:28,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 534 transitions, 11038 flow [2024-06-28 00:33:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:33:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:33:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-28 00:33:28,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-28 00:33:28,714 INFO L175 Difference]: Start difference. First operand has 309 places, 522 transitions, 9942 flow. Second operand 9 states and 135 transitions. [2024-06-28 00:33:28,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 534 transitions, 11038 flow [2024-06-28 00:33:29,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 534 transitions, 10844 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-28 00:33:29,662 INFO L231 Difference]: Finished difference. Result has 310 places, 522 transitions, 9940 flow [2024-06-28 00:33:29,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9748, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9940, PETRI_PLACES=310, PETRI_TRANSITIONS=522} [2024-06-28 00:33:29,663 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 268 predicate places. [2024-06-28 00:33:29,663 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 522 transitions, 9940 flow [2024-06-28 00:33:29,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:29,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:33:29,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:33:29,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 00:33:29,664 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:33:29,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:33:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash -264393787, now seen corresponding path program 12 times [2024-06-28 00:33:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:33:29,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965916713] [2024-06-28 00:33:29,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:33:29,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:33:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:33:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:33:33,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:33:33,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965916713] [2024-06-28 00:33:33,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965916713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:33:33,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:33:33,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:33:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392708591] [2024-06-28 00:33:33,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:33:33,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:33:33,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:33:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:33:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:33:33,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:33:33,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 522 transitions, 9940 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:33,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:33:33,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:33:33,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:33:36,479 INFO L124 PetriNetUnfolderBase]: 3609/5988 cut-off events. [2024-06-28 00:33:36,479 INFO L125 PetriNetUnfolderBase]: For 391963/391971 co-relation queries the response was YES. [2024-06-28 00:33:36,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49380 conditions, 5988 events. 3609/5988 cut-off events. For 391963/391971 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 40032 event pairs, 1182 based on Foata normal form. 11/5993 useless extension candidates. Maximal degree in co-relation 49239. Up to 5412 conditions per place. [2024-06-28 00:33:36,554 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 435 selfloop transitions, 148 changer transitions 0/588 dead transitions. [2024-06-28 00:33:36,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 588 transitions, 11945 flow [2024-06-28 00:33:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 00:33:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 00:33:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 225 transitions. [2024-06-28 00:33:36,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-28 00:33:36,556 INFO L175 Difference]: Start difference. First operand has 310 places, 522 transitions, 9940 flow. Second operand 15 states and 225 transitions. [2024-06-28 00:33:36,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 588 transitions, 11945 flow [2024-06-28 00:33:37,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 588 transitions, 11736 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 00:33:37,579 INFO L231 Difference]: Finished difference. Result has 320 places, 557 transitions, 10695 flow [2024-06-28 00:33:37,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9731, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10695, PETRI_PLACES=320, PETRI_TRANSITIONS=557} [2024-06-28 00:33:37,580 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 278 predicate places. [2024-06-28 00:33:37,580 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 557 transitions, 10695 flow [2024-06-28 00:33:37,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:33:37,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:33:37,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:33:37,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 00:33:37,580 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:33:37,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:33:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1584401539, now seen corresponding path program 2 times [2024-06-28 00:33:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:33:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578241897] [2024-06-28 00:33:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:33:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:33:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:33:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:33:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:33:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578241897] [2024-06-28 00:33:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578241897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:33:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:33:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:33:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759743443] [2024-06-28 00:33:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:33:42,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:33:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:33:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:33:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:33:42,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-28 00:33:42,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 557 transitions, 10695 flow. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-06-28 00:33:42,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:33:42,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-28 00:33:42,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:33:44,881 INFO L124 PetriNetUnfolderBase]: 3456/5774 cut-off events. [2024-06-28 00:33:44,881 INFO L125 PetriNetUnfolderBase]: For 418736/418762 co-relation queries the response was YES. [2024-06-28 00:33:44,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48541 conditions, 5774 events. 3456/5774 cut-off events. For 418736/418762 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 38797 event pairs, 853 based on Foata normal form. 29/5742 useless extension candidates. Maximal degree in co-relation 48395. Up to 4982 conditions per place. [2024-06-28 00:33:44,959 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 407 selfloop transitions, 98 changer transitions 0/587 dead transitions. [2024-06-28 00:33:44,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 587 transitions, 11892 flow [2024-06-28 00:33:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:33:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:33:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-06-28 00:33:44,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946784922394678 [2024-06-28 00:33:44,960 INFO L175 Difference]: Start difference. First operand has 320 places, 557 transitions, 10695 flow. Second operand 11 states and 178 transitions. [2024-06-28 00:33:44,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 587 transitions, 11892 flow [2024-06-28 00:33:46,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 587 transitions, 11548 flow, removed 91 selfloop flow, removed 5 redundant places. [2024-06-28 00:33:46,024 INFO L231 Difference]: Finished difference. Result has 326 places, 558 transitions, 10572 flow [2024-06-28 00:33:46,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10351, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10572, PETRI_PLACES=326, PETRI_TRANSITIONS=558} [2024-06-28 00:33:46,025 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 284 predicate places. [2024-06-28 00:33:46,025 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 558 transitions, 10572 flow [2024-06-28 00:33:46,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-06-28 00:33:46,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:33:46,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:33:46,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 00:33:46,025 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:33:46,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:33:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1584847009, now seen corresponding path program 3 times [2024-06-28 00:33:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:33:46,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868007380] [2024-06-28 00:33:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:33:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:33:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:33:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:33:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:33:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868007380] [2024-06-28 00:33:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868007380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:33:51,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:33:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:33:51,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743198329] [2024-06-28 00:33:51,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:33:51,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:33:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:33:51,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:33:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:33:51,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-28 00:33:51,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 558 transitions, 10572 flow. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-06-28 00:33:51,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:33:51,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-28 00:33:51,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:33:53,667 INFO L124 PetriNetUnfolderBase]: 3440/5755 cut-off events. [2024-06-28 00:33:53,667 INFO L125 PetriNetUnfolderBase]: For 403959/403979 co-relation queries the response was YES. [2024-06-28 00:33:53,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47857 conditions, 5755 events. 3440/5755 cut-off events. For 403959/403979 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 38660 event pairs, 830 based on Foata normal form. 26/5729 useless extension candidates. Maximal degree in co-relation 47710. Up to 4843 conditions per place. [2024-06-28 00:33:53,737 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 406 selfloop transitions, 103 changer transitions 0/591 dead transitions. [2024-06-28 00:33:53,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 591 transitions, 11796 flow [2024-06-28 00:33:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:33:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:33:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 179 transitions. [2024-06-28 00:33:53,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3968957871396896 [2024-06-28 00:33:53,738 INFO L175 Difference]: Start difference. First operand has 326 places, 558 transitions, 10572 flow. Second operand 11 states and 179 transitions. [2024-06-28 00:33:53,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 591 transitions, 11796 flow [2024-06-28 00:33:54,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 591 transitions, 11494 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-28 00:33:54,795 INFO L231 Difference]: Finished difference. Result has 325 places, 558 transitions, 10480 flow [2024-06-28 00:33:54,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10270, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10480, PETRI_PLACES=325, PETRI_TRANSITIONS=558} [2024-06-28 00:33:54,796 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 283 predicate places. [2024-06-28 00:33:54,796 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 558 transitions, 10480 flow [2024-06-28 00:33:54,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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-06-28 00:33:54,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:33:54,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:33:54,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 00:33:54,796 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:33:54,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:33:54,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1785719693, now seen corresponding path program 1 times [2024-06-28 00:33:54,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:33:54,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336279168] [2024-06-28 00:33:54,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:33:54,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:33:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:33:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:33:58,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:33:58,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336279168] [2024-06-28 00:33:58,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336279168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:33:58,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:33:58,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:33:58,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345673835] [2024-06-28 00:33:58,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:33:58,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:33:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:33:58,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:33:58,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:33:58,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:33:58,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 558 transitions, 10480 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:33:58,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:33:58,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:33:58,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:34:00,816 INFO L124 PetriNetUnfolderBase]: 3683/6093 cut-off events. [2024-06-28 00:34:00,816 INFO L125 PetriNetUnfolderBase]: For 433115/433115 co-relation queries the response was YES. [2024-06-28 00:34:00,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50821 conditions, 6093 events. 3683/6093 cut-off events. For 433115/433115 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 40648 event pairs, 1405 based on Foata normal form. 2/6087 useless extension candidates. Maximal degree in co-relation 50674. Up to 5459 conditions per place. [2024-06-28 00:34:00,892 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 549 selfloop transitions, 46 changer transitions 0/600 dead transitions. [2024-06-28 00:34:00,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 600 transitions, 12270 flow [2024-06-28 00:34:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:34:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:34:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 00:34:00,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-28 00:34:00,893 INFO L175 Difference]: Start difference. First operand has 325 places, 558 transitions, 10480 flow. Second operand 9 states and 150 transitions. [2024-06-28 00:34:00,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 600 transitions, 12270 flow [2024-06-28 00:34:02,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 600 transitions, 12058 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-28 00:34:02,008 INFO L231 Difference]: Finished difference. Result has 327 places, 564 transitions, 10491 flow [2024-06-28 00:34:02,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10268, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10491, PETRI_PLACES=327, PETRI_TRANSITIONS=564} [2024-06-28 00:34:02,009 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 285 predicate places. [2024-06-28 00:34:02,009 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 564 transitions, 10491 flow [2024-06-28 00:34:02,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:34:02,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:34:02,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:34:02,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 00:34:02,010 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:34:02,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:34:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash -663714513, now seen corresponding path program 2 times [2024-06-28 00:34:02,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:34:02,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622061815] [2024-06-28 00:34:02,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:34:02,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:34:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:34:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:34:05,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:34:05,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622061815] [2024-06-28 00:34:05,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622061815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:34:05,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:34:05,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:34:05,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263003848] [2024-06-28 00:34:05,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:34:05,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:34:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:34:05,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:34:05,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:34:05,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:34:05,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 564 transitions, 10491 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:34:05,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:34:05,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:34:05,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:34:08,274 INFO L124 PetriNetUnfolderBase]: 3691/6107 cut-off events. [2024-06-28 00:34:08,274 INFO L125 PetriNetUnfolderBase]: For 442840/442840 co-relation queries the response was YES. [2024-06-28 00:34:08,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51123 conditions, 6107 events. 3691/6107 cut-off events. For 442840/442840 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 40738 event pairs, 1439 based on Foata normal form. 2/6101 useless extension candidates. Maximal degree in co-relation 50973. Up to 5695 conditions per place. [2024-06-28 00:34:08,348 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 538 selfloop transitions, 42 changer transitions 0/585 dead transitions. [2024-06-28 00:34:08,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 585 transitions, 11790 flow [2024-06-28 00:34:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:34:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:34:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-28 00:34:08,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37398373983739835 [2024-06-28 00:34:08,350 INFO L175 Difference]: Start difference. First operand has 327 places, 564 transitions, 10491 flow. Second operand 9 states and 138 transitions. [2024-06-28 00:34:08,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 585 transitions, 11790 flow [2024-06-28 00:34:09,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 585 transitions, 11677 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-28 00:34:09,621 INFO L231 Difference]: Finished difference. Result has 331 places, 566 transitions, 10514 flow [2024-06-28 00:34:09,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10379, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10514, PETRI_PLACES=331, PETRI_TRANSITIONS=566} [2024-06-28 00:34:09,622 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 289 predicate places. [2024-06-28 00:34:09,622 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 566 transitions, 10514 flow [2024-06-28 00:34:09,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:34:09,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:34:09,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:34:09,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 00:34:09,622 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:34:09,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:34:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1697153933, now seen corresponding path program 3 times [2024-06-28 00:34:09,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:34:09,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093189864] [2024-06-28 00:34:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:34:09,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:34:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:34:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:34:13,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:34:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093189864] [2024-06-28 00:34:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093189864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:34:13,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:34:13,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:34:13,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412635115] [2024-06-28 00:34:13,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:34:13,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:34:13,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:34:13,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:34:13,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:34:13,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:34:13,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 566 transitions, 10514 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:34:13,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:34:13,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:34:13,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:34:15,786 INFO L124 PetriNetUnfolderBase]: 3686/6100 cut-off events. [2024-06-28 00:34:15,786 INFO L125 PetriNetUnfolderBase]: For 449848/449848 co-relation queries the response was YES. [2024-06-28 00:34:15,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50984 conditions, 6100 events. 3686/6100 cut-off events. For 449848/449848 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 40711 event pairs, 1433 based on Foata normal form. 2/6094 useless extension candidates. Maximal degree in co-relation 50833. Up to 5616 conditions per place. [2024-06-28 00:34:15,866 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 545 selfloop transitions, 43 changer transitions 0/593 dead transitions. [2024-06-28 00:34:15,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 593 transitions, 12021 flow [2024-06-28 00:34:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:34:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:34:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-28 00:34:15,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-28 00:34:15,867 INFO L175 Difference]: Start difference. First operand has 331 places, 566 transitions, 10514 flow. Second operand 9 states and 144 transitions. [2024-06-28 00:34:15,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 593 transitions, 12021 flow [2024-06-28 00:34:17,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 593 transitions, 11900 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-28 00:34:17,286 INFO L231 Difference]: Finished difference. Result has 334 places, 569 transitions, 10551 flow [2024-06-28 00:34:17,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10393, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10551, PETRI_PLACES=334, PETRI_TRANSITIONS=569} [2024-06-28 00:34:17,286 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 292 predicate places. [2024-06-28 00:34:17,286 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 569 transitions, 10551 flow [2024-06-28 00:34:17,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-06-28 00:34:17,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:34:17,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:34:17,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 00:34:17,287 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:34:17,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:34:17,288 INFO L85 PathProgramCache]: Analyzing trace with hash 381124577, now seen corresponding path program 1 times [2024-06-28 00:34:17,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:34:17,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567264567] [2024-06-28 00:34:17,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:34:17,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:34:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:34:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:34:22,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:34:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567264567] [2024-06-28 00:34:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567264567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:34:22,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:34:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:34:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633739332] [2024-06-28 00:34:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:34:22,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:34:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:34:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:34:22,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:34:22,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:34:22,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 569 transitions, 10551 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:34:22,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:34:22,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:34:22,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:34:24,943 INFO L124 PetriNetUnfolderBase]: 3701/6125 cut-off events. [2024-06-28 00:34:24,943 INFO L125 PetriNetUnfolderBase]: For 469708/469708 co-relation queries the response was YES. [2024-06-28 00:34:24,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51267 conditions, 6125 events. 3701/6125 cut-off events. For 469708/469708 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 40888 event pairs, 1442 based on Foata normal form. 8/6125 useless extension candidates. Maximal degree in co-relation 51115. Up to 5677 conditions per place. [2024-06-28 00:34:25,024 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 546 selfloop transitions, 41 changer transitions 0/592 dead transitions. [2024-06-28 00:34:25,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 592 transitions, 11884 flow [2024-06-28 00:34:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:34:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:34:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-28 00:34:25,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-28 00:34:25,026 INFO L175 Difference]: Start difference. First operand has 334 places, 569 transitions, 10551 flow. Second operand 9 states and 141 transitions. [2024-06-28 00:34:25,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 592 transitions, 11884 flow [2024-06-28 00:34:26,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 592 transitions, 11682 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-28 00:34:26,495 INFO L231 Difference]: Finished difference. Result has 336 places, 570 transitions, 10463 flow [2024-06-28 00:34:26,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10356, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10463, PETRI_PLACES=336, PETRI_TRANSITIONS=570} [2024-06-28 00:34:26,496 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 294 predicate places. [2024-06-28 00:34:26,496 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 570 transitions, 10463 flow [2024-06-28 00:34:26,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:34:26,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:34:26,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:34:26,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 00:34:26,496 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:34:26,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:34:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1322630533, now seen corresponding path program 2 times [2024-06-28 00:34:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:34:26,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737630598] [2024-06-28 00:34:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:34:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:34:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:34:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:34:31,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:34:31,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737630598] [2024-06-28 00:34:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737630598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:34:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:34:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:34:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152818207] [2024-06-28 00:34:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:34:31,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:34:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:34:31,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:34:31,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:34:31,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:34:31,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 570 transitions, 10463 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:34:31,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:34:31,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:34:31,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:34:33,752 INFO L124 PetriNetUnfolderBase]: 3737/6181 cut-off events. [2024-06-28 00:34:33,752 INFO L125 PetriNetUnfolderBase]: For 481670/481670 co-relation queries the response was YES. [2024-06-28 00:34:33,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51171 conditions, 6181 events. 3737/6181 cut-off events. For 481670/481670 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 41339 event pairs, 1445 based on Foata normal form. 8/6181 useless extension candidates. Maximal degree in co-relation 51019. Up to 5753 conditions per place. [2024-06-28 00:34:33,841 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 555 selfloop transitions, 32 changer transitions 0/592 dead transitions. [2024-06-28 00:34:33,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 592 transitions, 11820 flow [2024-06-28 00:34:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:34:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:34:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-28 00:34:33,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-28 00:34:33,842 INFO L175 Difference]: Start difference. First operand has 336 places, 570 transitions, 10463 flow. Second operand 9 states and 135 transitions. [2024-06-28 00:34:33,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 592 transitions, 11820 flow [2024-06-28 00:34:35,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 592 transitions, 11737 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-28 00:34:35,502 INFO L231 Difference]: Finished difference. Result has 338 places, 572 transitions, 10490 flow [2024-06-28 00:34:35,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10380, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10490, PETRI_PLACES=338, PETRI_TRANSITIONS=572} [2024-06-28 00:34:35,503 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 296 predicate places. [2024-06-28 00:34:35,503 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 572 transitions, 10490 flow [2024-06-28 00:34:35,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:34:35,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:34:35,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:34:35,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 00:34:35,504 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:34:35,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:34:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1577234401, now seen corresponding path program 3 times [2024-06-28 00:34:35,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:34:35,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324023958] [2024-06-28 00:34:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:34:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:34:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:34:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:34:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:34:40,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324023958] [2024-06-28 00:34:40,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324023958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:34:40,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:34:40,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:34:40,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111480447] [2024-06-28 00:34:40,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:34:40,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:34:40,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:34:40,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:34:40,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:34:40,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:34:40,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 572 transitions, 10490 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:34:40,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:34:40,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:34:40,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:34:42,550 INFO L124 PetriNetUnfolderBase]: 3760/6218 cut-off events. [2024-06-28 00:34:42,550 INFO L125 PetriNetUnfolderBase]: For 488443/488443 co-relation queries the response was YES. [2024-06-28 00:34:42,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51408 conditions, 6218 events. 3760/6218 cut-off events. For 488443/488443 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 41562 event pairs, 1450 based on Foata normal form. 8/6218 useless extension candidates. Maximal degree in co-relation 51255. Up to 5786 conditions per place. [2024-06-28 00:34:42,643 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 558 selfloop transitions, 33 changer transitions 0/596 dead transitions. [2024-06-28 00:34:42,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 596 transitions, 11863 flow [2024-06-28 00:34:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:34:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:34:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2024-06-28 00:34:42,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34811529933481156 [2024-06-28 00:34:42,644 INFO L175 Difference]: Start difference. First operand has 338 places, 572 transitions, 10490 flow. Second operand 11 states and 157 transitions. [2024-06-28 00:34:42,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 596 transitions, 11863 flow [2024-06-28 00:34:44,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 596 transitions, 11796 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-28 00:34:44,149 INFO L231 Difference]: Finished difference. Result has 342 places, 574 transitions, 10541 flow [2024-06-28 00:34:44,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10423, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10541, PETRI_PLACES=342, PETRI_TRANSITIONS=574} [2024-06-28 00:34:44,150 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 300 predicate places. [2024-06-28 00:34:44,150 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 574 transitions, 10541 flow [2024-06-28 00:34:44,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:34:44,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:34:44,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:34:44,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 00:34:44,150 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:34:44,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:34:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1584852961, now seen corresponding path program 4 times [2024-06-28 00:34:44,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:34:44,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253319055] [2024-06-28 00:34:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:34:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:34:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:34:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:34:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:34:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253319055] [2024-06-28 00:34:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253319055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:34:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:34:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:34:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308539931] [2024-06-28 00:34:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:34:48,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:34:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:34:48,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:34:48,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:34:48,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:34:48,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 574 transitions, 10541 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:34:48,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:34:48,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:34:48,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:34:51,211 INFO L124 PetriNetUnfolderBase]: 3747/6201 cut-off events. [2024-06-28 00:34:51,211 INFO L125 PetriNetUnfolderBase]: For 478040/478040 co-relation queries the response was YES. [2024-06-28 00:34:51,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51047 conditions, 6201 events. 3747/6201 cut-off events. For 478040/478040 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 41367 event pairs, 1427 based on Foata normal form. 6/6199 useless extension candidates. Maximal degree in co-relation 50893. Up to 5695 conditions per place. [2024-06-28 00:34:51,298 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 555 selfloop transitions, 38 changer transitions 0/598 dead transitions. [2024-06-28 00:34:51,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 598 transitions, 11886 flow [2024-06-28 00:34:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:34:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:34:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2024-06-28 00:34:51,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35033259423503327 [2024-06-28 00:34:51,299 INFO L175 Difference]: Start difference. First operand has 342 places, 574 transitions, 10541 flow. Second operand 11 states and 158 transitions. [2024-06-28 00:34:51,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 598 transitions, 11886 flow [2024-06-28 00:34:52,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 598 transitions, 11815 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-28 00:34:52,877 INFO L231 Difference]: Finished difference. Result has 344 places, 574 transitions, 10550 flow [2024-06-28 00:34:52,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10470, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10550, PETRI_PLACES=344, PETRI_TRANSITIONS=574} [2024-06-28 00:34:52,878 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 302 predicate places. [2024-06-28 00:34:52,878 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 574 transitions, 10550 flow [2024-06-28 00:34:52,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:34:52,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:34:52,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:34:52,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 00:34:52,878 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:34:52,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:34:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1524137952, now seen corresponding path program 1 times [2024-06-28 00:34:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:34:52,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033918544] [2024-06-28 00:34:52,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:34:52,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:34:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:34:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:34:57,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:34:57,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033918544] [2024-06-28 00:34:57,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033918544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:34:57,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:34:57,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:34:57,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286021553] [2024-06-28 00:34:57,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:34:57,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:34:57,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:34:57,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:34:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:34:57,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:34:57,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 574 transitions, 10550 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:34:57,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:34:57,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:34:57,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:34:59,947 INFO L124 PetriNetUnfolderBase]: 3744/6217 cut-off events. [2024-06-28 00:34:59,947 INFO L125 PetriNetUnfolderBase]: For 473284/473301 co-relation queries the response was YES. [2024-06-28 00:35:00,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51109 conditions, 6217 events. 3744/6217 cut-off events. For 473284/473301 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 41649 event pairs, 1199 based on Foata normal form. 15/6229 useless extension candidates. Maximal degree in co-relation 50954. Up to 5544 conditions per place. [2024-06-28 00:35:00,032 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 419 selfloop transitions, 176 changer transitions 0/600 dead transitions. [2024-06-28 00:35:00,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 600 transitions, 12084 flow [2024-06-28 00:35:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:35:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:35:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-28 00:35:00,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3804878048780488 [2024-06-28 00:35:00,033 INFO L175 Difference]: Start difference. First operand has 344 places, 574 transitions, 10550 flow. Second operand 10 states and 156 transitions. [2024-06-28 00:35:00,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 600 transitions, 12084 flow [2024-06-28 00:35:01,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 600 transitions, 11984 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-28 00:35:01,560 INFO L231 Difference]: Finished difference. Result has 345 places, 574 transitions, 10833 flow [2024-06-28 00:35:01,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10450, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10833, PETRI_PLACES=345, PETRI_TRANSITIONS=574} [2024-06-28 00:35:01,561 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 303 predicate places. [2024-06-28 00:35:01,561 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 574 transitions, 10833 flow [2024-06-28 00:35:01,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:35:01,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:35:01,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:35:01,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 00:35:01,562 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:35:01,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:35:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1975181042, now seen corresponding path program 2 times [2024-06-28 00:35:01,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:35:01,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118080904] [2024-06-28 00:35:01,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:35:01,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:35:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:35:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:35:05,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:35:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118080904] [2024-06-28 00:35:05,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118080904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:35:05,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:35:05,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:35:05,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171359121] [2024-06-28 00:35:05,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:35:05,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:35:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:35:05,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:35:05,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:35:06,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:35:06,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 574 transitions, 10833 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:35:06,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:35:06,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:35:06,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:35:08,564 INFO L124 PetriNetUnfolderBase]: 3738/6205 cut-off events. [2024-06-28 00:35:08,564 INFO L125 PetriNetUnfolderBase]: For 479872/479883 co-relation queries the response was YES. [2024-06-28 00:35:08,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51324 conditions, 6205 events. 3738/6205 cut-off events. For 479872/479883 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 41235 event pairs, 918 based on Foata normal form. 3/6202 useless extension candidates. Maximal degree in co-relation 51168. Up to 5446 conditions per place. [2024-06-28 00:35:08,640 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 389 selfloop transitions, 200 changer transitions 0/594 dead transitions. [2024-06-28 00:35:08,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 594 transitions, 12319 flow [2024-06-28 00:35:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:35:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:35:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-28 00:35:08,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-28 00:35:08,641 INFO L175 Difference]: Start difference. First operand has 345 places, 574 transitions, 10833 flow. Second operand 9 states and 144 transitions. [2024-06-28 00:35:08,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 594 transitions, 12319 flow [2024-06-28 00:35:10,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 594 transitions, 12058 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-28 00:35:10,295 INFO L231 Difference]: Finished difference. Result has 346 places, 574 transitions, 11024 flow [2024-06-28 00:35:10,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10576, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11024, PETRI_PLACES=346, PETRI_TRANSITIONS=574} [2024-06-28 00:35:10,297 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 304 predicate places. [2024-06-28 00:35:10,297 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 574 transitions, 11024 flow [2024-06-28 00:35:10,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:35:10,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:35:10,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:35:10,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 00:35:10,298 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:35:10,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:35:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1056122132, now seen corresponding path program 3 times [2024-06-28 00:35:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:35:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228204787] [2024-06-28 00:35:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:35:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:35:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:35:14,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-06-28 00:35:14,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:35:14,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228204787] [2024-06-28 00:35:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228204787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:35:14,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:35:14,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:35:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172602634] [2024-06-28 00:35:14,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:35:14,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:35:14,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:35:14,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:35:14,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:35:15,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:35:15,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 574 transitions, 11024 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:35:15,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:35:15,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:35:15,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:35:17,615 INFO L124 PetriNetUnfolderBase]: 3729/6193 cut-off events. [2024-06-28 00:35:17,615 INFO L125 PetriNetUnfolderBase]: For 465203/465214 co-relation queries the response was YES. [2024-06-28 00:35:17,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50964 conditions, 6193 events. 3729/6193 cut-off events. For 465203/465214 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 41144 event pairs, 926 based on Foata normal form. 4/6191 useless extension candidates. Maximal degree in co-relation 50809. Up to 5438 conditions per place. [2024-06-28 00:35:17,698 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 389 selfloop transitions, 200 changer transitions 0/594 dead transitions. [2024-06-28 00:35:17,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 594 transitions, 12362 flow [2024-06-28 00:35:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:35:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:35:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-28 00:35:17,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3804878048780488 [2024-06-28 00:35:17,700 INFO L175 Difference]: Start difference. First operand has 346 places, 574 transitions, 11024 flow. Second operand 10 states and 156 transitions. [2024-06-28 00:35:17,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 594 transitions, 12362 flow [2024-06-28 00:35:19,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 594 transitions, 11949 flow, removed 16 selfloop flow, removed 11 redundant places. [2024-06-28 00:35:19,354 INFO L231 Difference]: Finished difference. Result has 345 places, 574 transitions, 11074 flow [2024-06-28 00:35:19,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10611, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11074, PETRI_PLACES=345, PETRI_TRANSITIONS=574} [2024-06-28 00:35:19,355 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 303 predicate places. [2024-06-28 00:35:19,355 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 574 transitions, 11074 flow [2024-06-28 00:35:19,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-06-28 00:35:19,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:35:19,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:35:19,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 00:35:19,356 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:35:19,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:35:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash -310795646, now seen corresponding path program 1 times [2024-06-28 00:35:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:35:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137292140] [2024-06-28 00:35:19,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:35:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:35:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:35:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:35:24,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:35:24,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137292140] [2024-06-28 00:35:24,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137292140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:35:24,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:35:24,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:35:24,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104608257] [2024-06-28 00:35:24,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:35:24,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:35:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:35:24,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:35:24,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:35:24,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:35:24,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 574 transitions, 11074 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:35:24,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:35:24,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:35:24,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:35:27,255 INFO L124 PetriNetUnfolderBase]: 3850/6361 cut-off events. [2024-06-28 00:35:27,255 INFO L125 PetriNetUnfolderBase]: For 473969/473977 co-relation queries the response was YES. [2024-06-28 00:35:27,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52231 conditions, 6361 events. 3850/6361 cut-off events. For 473969/473977 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 42364 event pairs, 965 based on Foata normal form. 11/6352 useless extension candidates. Maximal degree in co-relation 52078. Up to 5565 conditions per place. [2024-06-28 00:35:27,330 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 531 selfloop transitions, 93 changer transitions 0/629 dead transitions. [2024-06-28 00:35:27,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 629 transitions, 12878 flow [2024-06-28 00:35:27,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:35:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:35:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-28 00:35:27,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212860310421286 [2024-06-28 00:35:27,332 INFO L175 Difference]: Start difference. First operand has 345 places, 574 transitions, 11074 flow. Second operand 11 states and 190 transitions. [2024-06-28 00:35:27,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 629 transitions, 12878 flow [2024-06-28 00:35:28,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 629 transitions, 12372 flow, removed 12 selfloop flow, removed 12 redundant places. [2024-06-28 00:35:28,654 INFO L231 Difference]: Finished difference. Result has 346 places, 582 transitions, 10928 flow [2024-06-28 00:35:28,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10574, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10928, PETRI_PLACES=346, PETRI_TRANSITIONS=582} [2024-06-28 00:35:28,654 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 304 predicate places. [2024-06-28 00:35:28,654 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 582 transitions, 10928 flow [2024-06-28 00:35:28,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:35:28,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:35:28,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:35:28,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 00:35:28,655 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:35:28,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:35:28,655 INFO L85 PathProgramCache]: Analyzing trace with hash -602868490, now seen corresponding path program 2 times [2024-06-28 00:35:28,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:35:28,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463617963] [2024-06-28 00:35:28,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:35:28,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:35:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:35:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:35:34,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:35:34,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463617963] [2024-06-28 00:35:34,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463617963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:35:34,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:35:34,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:35:34,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663291854] [2024-06-28 00:35:34,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:35:34,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:35:34,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:35:34,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:35:34,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:35:34,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:35:34,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 582 transitions, 10928 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:35:34,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:35:34,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:35:34,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:35:37,525 INFO L124 PetriNetUnfolderBase]: 3971/6558 cut-off events. [2024-06-28 00:35:37,525 INFO L125 PetriNetUnfolderBase]: For 454340/454348 co-relation queries the response was YES. [2024-06-28 00:35:37,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53385 conditions, 6558 events. 3971/6558 cut-off events. For 454340/454348 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 43772 event pairs, 1025 based on Foata normal form. 11/6561 useless extension candidates. Maximal degree in co-relation 53232. Up to 5889 conditions per place. [2024-06-28 00:35:37,620 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 539 selfloop transitions, 98 changer transitions 0/642 dead transitions. [2024-06-28 00:35:37,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 642 transitions, 12895 flow [2024-06-28 00:35:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:35:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:35:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 195 transitions. [2024-06-28 00:35:37,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-28 00:35:37,621 INFO L175 Difference]: Start difference. First operand has 346 places, 582 transitions, 10928 flow. Second operand 12 states and 195 transitions. [2024-06-28 00:35:37,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 642 transitions, 12895 flow [2024-06-28 00:35:39,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 642 transitions, 12747 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-28 00:35:39,166 INFO L231 Difference]: Finished difference. Result has 354 places, 599 transitions, 11397 flow [2024-06-28 00:35:39,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10791, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11397, PETRI_PLACES=354, PETRI_TRANSITIONS=599} [2024-06-28 00:35:39,167 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 312 predicate places. [2024-06-28 00:35:39,167 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 599 transitions, 11397 flow [2024-06-28 00:35:39,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:35:39,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:35:39,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:35:39,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 00:35:39,167 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:35:39,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:35:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash -325812190, now seen corresponding path program 3 times [2024-06-28 00:35:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:35:39,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123515534] [2024-06-28 00:35:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:35:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:35:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:35:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:35:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:35:45,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123515534] [2024-06-28 00:35:45,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123515534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:35:45,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:35:45,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:35:45,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817226673] [2024-06-28 00:35:45,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:35:45,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:35:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:35:45,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:35:45,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:35:45,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:35:45,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 599 transitions, 11397 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:35:45,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:35:45,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:35:45,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:35:47,909 INFO L124 PetriNetUnfolderBase]: 4043/6676 cut-off events. [2024-06-28 00:35:47,910 INFO L125 PetriNetUnfolderBase]: For 466260/466266 co-relation queries the response was YES. [2024-06-28 00:35:47,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54610 conditions, 6676 events. 4043/6676 cut-off events. For 466260/466266 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 44642 event pairs, 983 based on Foata normal form. 9/6680 useless extension candidates. Maximal degree in co-relation 54454. Up to 6005 conditions per place. [2024-06-28 00:35:48,003 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 541 selfloop transitions, 96 changer transitions 0/642 dead transitions. [2024-06-28 00:35:48,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 642 transitions, 13050 flow [2024-06-28 00:35:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:35:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:35:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 192 transitions. [2024-06-28 00:35:48,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-28 00:35:48,004 INFO L175 Difference]: Start difference. First operand has 354 places, 599 transitions, 11397 flow. Second operand 12 states and 192 transitions. [2024-06-28 00:35:48,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 642 transitions, 13050 flow [2024-06-28 00:35:49,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 642 transitions, 12853 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 00:35:49,822 INFO L231 Difference]: Finished difference. Result has 361 places, 605 transitions, 11543 flow [2024-06-28 00:35:49,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11202, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11543, PETRI_PLACES=361, PETRI_TRANSITIONS=605} [2024-06-28 00:35:49,823 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 319 predicate places. [2024-06-28 00:35:49,823 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 605 transitions, 11543 flow [2024-06-28 00:35:49,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:35:49,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:35:49,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:35:49,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 00:35:49,824 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:35:49,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:35:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 109677988, now seen corresponding path program 1 times [2024-06-28 00:35:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:35:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350640323] [2024-06-28 00:35:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:35:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:35:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:35:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:35:55,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:35:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350640323] [2024-06-28 00:35:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350640323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:35:55,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:35:55,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:35:55,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333038268] [2024-06-28 00:35:55,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:35:55,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:35:55,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:35:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:35:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:35:55,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:35:55,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 605 transitions, 11543 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:35:55,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:35:55,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:35:55,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:35:58,741 INFO L124 PetriNetUnfolderBase]: 4052/6706 cut-off events. [2024-06-28 00:35:58,742 INFO L125 PetriNetUnfolderBase]: For 462268/462276 co-relation queries the response was YES. [2024-06-28 00:35:58,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54883 conditions, 6706 events. 4052/6706 cut-off events. For 462268/462276 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 45051 event pairs, 1041 based on Foata normal form. 6/6707 useless extension candidates. Maximal degree in co-relation 54724. Up to 5993 conditions per place. [2024-06-28 00:35:58,829 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 500 selfloop transitions, 147 changer transitions 0/652 dead transitions. [2024-06-28 00:35:58,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 652 transitions, 13281 flow [2024-06-28 00:35:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:35:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:35:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2024-06-28 00:35:58,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4079822616407982 [2024-06-28 00:35:58,831 INFO L175 Difference]: Start difference. First operand has 361 places, 605 transitions, 11543 flow. Second operand 11 states and 184 transitions. [2024-06-28 00:35:58,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 652 transitions, 13281 flow [2024-06-28 00:36:00,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 652 transitions, 13056 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-28 00:36:00,207 INFO L231 Difference]: Finished difference. Result has 366 places, 613 transitions, 11877 flow [2024-06-28 00:36:00,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11326, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11877, PETRI_PLACES=366, PETRI_TRANSITIONS=613} [2024-06-28 00:36:00,207 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 324 predicate places. [2024-06-28 00:36:00,207 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 613 transitions, 11877 flow [2024-06-28 00:36:00,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:36:00,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:36:00,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:36:00,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-28 00:36:00,208 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:36:00,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:36:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash -611263038, now seen corresponding path program 2 times [2024-06-28 00:36:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:36:00,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209664122] [2024-06-28 00:36:00,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:36:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:36:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:36:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:36:07,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:36:07,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209664122] [2024-06-28 00:36:07,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209664122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:36:07,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:36:07,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:36:07,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906726305] [2024-06-28 00:36:07,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:36:07,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:36:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:36:07,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:36:07,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:36:08,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:36:08,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 613 transitions, 11877 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:36:08,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:36:08,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:36:08,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:36:10,858 INFO L124 PetriNetUnfolderBase]: 4114/6775 cut-off events. [2024-06-28 00:36:10,858 INFO L125 PetriNetUnfolderBase]: For 485284/485294 co-relation queries the response was YES. [2024-06-28 00:36:10,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56171 conditions, 6775 events. 4114/6775 cut-off events. For 485284/485294 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 45312 event pairs, 1009 based on Foata normal form. 5/6774 useless extension candidates. Maximal degree in co-relation 56010. Up to 5650 conditions per place. [2024-06-28 00:36:10,957 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 371 selfloop transitions, 302 changer transitions 0/678 dead transitions. [2024-06-28 00:36:10,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 678 transitions, 14164 flow [2024-06-28 00:36:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:36:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:36:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 210 transitions. [2024-06-28 00:36:10,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39399624765478425 [2024-06-28 00:36:10,959 INFO L175 Difference]: Start difference. First operand has 366 places, 613 transitions, 11877 flow. Second operand 13 states and 210 transitions. [2024-06-28 00:36:10,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 678 transitions, 14164 flow [2024-06-28 00:36:12,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 678 transitions, 13798 flow, removed 56 selfloop flow, removed 9 redundant places. [2024-06-28 00:36:12,720 INFO L231 Difference]: Finished difference. Result has 371 places, 632 transitions, 12477 flow [2024-06-28 00:36:12,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11511, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12477, PETRI_PLACES=371, PETRI_TRANSITIONS=632} [2024-06-28 00:36:12,721 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 329 predicate places. [2024-06-28 00:36:12,721 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 632 transitions, 12477 flow [2024-06-28 00:36:12,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:36:12,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:36:12,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:36:12,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-28 00:36:12,722 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:36:12,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:36:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -602931168, now seen corresponding path program 3 times [2024-06-28 00:36:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:36:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282380695] [2024-06-28 00:36:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:36:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:36:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:36:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:36:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:36:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282380695] [2024-06-28 00:36:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282380695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:36:19,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:36:19,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:36:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278365001] [2024-06-28 00:36:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:36:19,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:36:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:36:19,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:36:19,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:36:19,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:36:19,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 632 transitions, 12477 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:36:19,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:36:19,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:36:19,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:36:22,704 INFO L124 PetriNetUnfolderBase]: 4150/6829 cut-off events. [2024-06-28 00:36:22,705 INFO L125 PetriNetUnfolderBase]: For 503160/503170 co-relation queries the response was YES. [2024-06-28 00:36:22,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57391 conditions, 6829 events. 4150/6829 cut-off events. For 503160/503170 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 45768 event pairs, 1012 based on Foata normal form. 5/6828 useless extension candidates. Maximal degree in co-relation 57228. Up to 5683 conditions per place. [2024-06-28 00:36:22,802 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 382 selfloop transitions, 303 changer transitions 0/690 dead transitions. [2024-06-28 00:36:22,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 690 transitions, 14876 flow [2024-06-28 00:36:22,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:36:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:36:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 213 transitions. [2024-06-28 00:36:22,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.399624765478424 [2024-06-28 00:36:22,804 INFO L175 Difference]: Start difference. First operand has 371 places, 632 transitions, 12477 flow. Second operand 13 states and 213 transitions. [2024-06-28 00:36:22,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 690 transitions, 14876 flow [2024-06-28 00:36:24,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 690 transitions, 14426 flow, removed 139 selfloop flow, removed 6 redundant places. [2024-06-28 00:36:24,546 INFO L231 Difference]: Finished difference. Result has 378 places, 642 transitions, 12847 flow [2024-06-28 00:36:24,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12119, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=293, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12847, PETRI_PLACES=378, PETRI_TRANSITIONS=642} [2024-06-28 00:36:24,547 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 336 predicate places. [2024-06-28 00:36:24,547 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 642 transitions, 12847 flow [2024-06-28 00:36:24,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:36:24,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:36:24,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:36:24,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-28 00:36:24,548 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:36:24,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:36:24,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1070284588, now seen corresponding path program 4 times [2024-06-28 00:36:24,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:36:24,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809986323] [2024-06-28 00:36:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:36:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:36:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:36:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:36:30,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:36:30,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809986323] [2024-06-28 00:36:30,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809986323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:36:30,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:36:30,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:36:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144647214] [2024-06-28 00:36:30,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:36:30,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:36:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:36:30,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:36:30,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:36:30,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:36:30,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 642 transitions, 12847 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:36:30,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:36:30,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:36:30,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:36:33,246 INFO L124 PetriNetUnfolderBase]: 4141/6813 cut-off events. [2024-06-28 00:36:33,246 INFO L125 PetriNetUnfolderBase]: For 506346/506356 co-relation queries the response was YES. [2024-06-28 00:36:33,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57544 conditions, 6813 events. 4141/6813 cut-off events. For 506346/506356 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 45568 event pairs, 1015 based on Foata normal form. 5/6812 useless extension candidates. Maximal degree in co-relation 57379. Up to 5676 conditions per place. [2024-06-28 00:36:33,345 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 380 selfloop transitions, 300 changer transitions 0/685 dead transitions. [2024-06-28 00:36:33,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 685 transitions, 14843 flow [2024-06-28 00:36:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:36:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:36:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-28 00:36:33,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-28 00:36:33,346 INFO L175 Difference]: Start difference. First operand has 378 places, 642 transitions, 12847 flow. Second operand 11 states and 187 transitions. [2024-06-28 00:36:33,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 685 transitions, 14843 flow [2024-06-28 00:36:35,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 685 transitions, 14246 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-06-28 00:36:35,233 INFO L231 Difference]: Finished difference. Result has 379 places, 642 transitions, 12862 flow [2024-06-28 00:36:35,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12250, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=300, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12862, PETRI_PLACES=379, PETRI_TRANSITIONS=642} [2024-06-28 00:36:35,234 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 337 predicate places. [2024-06-28 00:36:35,234 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 642 transitions, 12862 flow [2024-06-28 00:36:35,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:36:35,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:36:35,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:36:35,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-28 00:36:35,234 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:36:35,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:36:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash -893009256, now seen corresponding path program 1 times [2024-06-28 00:36:35,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:36:35,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935843776] [2024-06-28 00:36:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:36:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:36:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:36:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:36:40,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:36:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935843776] [2024-06-28 00:36:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935843776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:36:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:36:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:36:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109122769] [2024-06-28 00:36:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:36:40,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:36:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:36:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:36:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:36:40,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:36:40,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 642 transitions, 12862 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:36:40,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:36:40,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:36:40,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:36:43,303 INFO L124 PetriNetUnfolderBase]: 4185/6893 cut-off events. [2024-06-28 00:36:43,303 INFO L125 PetriNetUnfolderBase]: For 514339/514345 co-relation queries the response was YES. [2024-06-28 00:36:43,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58105 conditions, 6893 events. 4185/6893 cut-off events. For 514339/514345 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 46144 event pairs, 1004 based on Foata normal form. 3/6891 useless extension candidates. Maximal degree in co-relation 57940. Up to 6283 conditions per place. [2024-06-28 00:36:43,397 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 591 selfloop transitions, 71 changer transitions 0/667 dead transitions. [2024-06-28 00:36:43,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 667 transitions, 14343 flow [2024-06-28 00:36:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:36:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:36:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-28 00:36:43,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-28 00:36:43,399 INFO L175 Difference]: Start difference. First operand has 379 places, 642 transitions, 12862 flow. Second operand 8 states and 137 transitions. [2024-06-28 00:36:43,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 667 transitions, 14343 flow [2024-06-28 00:36:45,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 667 transitions, 13805 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 00:36:45,253 INFO L231 Difference]: Finished difference. Result has 378 places, 646 transitions, 12549 flow [2024-06-28 00:36:45,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12324, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12549, PETRI_PLACES=378, PETRI_TRANSITIONS=646} [2024-06-28 00:36:45,254 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 336 predicate places. [2024-06-28 00:36:45,254 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 646 transitions, 12549 flow [2024-06-28 00:36:45,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:36:45,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:36:45,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:36:45,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-28 00:36:45,255 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:36:45,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:36:45,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2022044500, now seen corresponding path program 5 times [2024-06-28 00:36:45,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:36:45,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192387356] [2024-06-28 00:36:45,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:36:45,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:36:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:36:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:36:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:36:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192387356] [2024-06-28 00:36:51,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192387356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:36:51,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:36:51,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:36:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704609917] [2024-06-28 00:36:51,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:36:51,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:36:51,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:36:51,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:36:51,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:36:51,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:36:51,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 646 transitions, 12549 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:36:51,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:36:51,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:36:51,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:36:54,609 INFO L124 PetriNetUnfolderBase]: 4237/6985 cut-off events. [2024-06-28 00:36:54,609 INFO L125 PetriNetUnfolderBase]: For 535374/535380 co-relation queries the response was YES. [2024-06-28 00:36:54,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58629 conditions, 6985 events. 4237/6985 cut-off events. For 535374/535380 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 46939 event pairs, 1004 based on Foata normal form. 3/6983 useless extension candidates. Maximal degree in co-relation 58463. Up to 6258 conditions per place. [2024-06-28 00:36:54,709 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 554 selfloop transitions, 139 changer transitions 0/698 dead transitions. [2024-06-28 00:36:54,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 698 transitions, 14739 flow [2024-06-28 00:36:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:36:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:36:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-06-28 00:36:54,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.401330376940133 [2024-06-28 00:36:54,711 INFO L175 Difference]: Start difference. First operand has 378 places, 646 transitions, 12549 flow. Second operand 11 states and 181 transitions. [2024-06-28 00:36:54,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 698 transitions, 14739 flow [2024-06-28 00:36:56,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 698 transitions, 14608 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 00:36:56,594 INFO L231 Difference]: Finished difference. Result has 384 places, 659 transitions, 12882 flow [2024-06-28 00:36:56,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12418, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12882, PETRI_PLACES=384, PETRI_TRANSITIONS=659} [2024-06-28 00:36:56,595 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 342 predicate places. [2024-06-28 00:36:56,595 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 659 transitions, 12882 flow [2024-06-28 00:36:56,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:36:56,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:36:56,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:36:56,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-28 00:36:56,595 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:36:56,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:36:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash -893014898, now seen corresponding path program 6 times [2024-06-28 00:36:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:36:56,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523801126] [2024-06-28 00:36:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:36:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:36:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:37:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:37:05,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:37:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523801126] [2024-06-28 00:37:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523801126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:37:05,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:37:05,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:37:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768777402] [2024-06-28 00:37:05,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:37:05,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:37:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:37:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:37:05,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:37:05,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:37:05,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 659 transitions, 12882 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:05,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:37:05,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:37:05,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:37:08,705 INFO L124 PetriNetUnfolderBase]: 4231/6973 cut-off events. [2024-06-28 00:37:08,705 INFO L125 PetriNetUnfolderBase]: For 541976/541982 co-relation queries the response was YES. [2024-06-28 00:37:08,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58703 conditions, 6973 events. 4231/6973 cut-off events. For 541976/541982 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 46785 event pairs, 1014 based on Foata normal form. 3/6971 useless extension candidates. Maximal degree in co-relation 58536. Up to 6253 conditions per place. [2024-06-28 00:37:08,798 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 545 selfloop transitions, 142 changer transitions 0/692 dead transitions. [2024-06-28 00:37:08,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 692 transitions, 14662 flow [2024-06-28 00:37:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:37:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:37:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 188 transitions. [2024-06-28 00:37:08,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-28 00:37:08,800 INFO L175 Difference]: Start difference. First operand has 384 places, 659 transitions, 12882 flow. Second operand 12 states and 188 transitions. [2024-06-28 00:37:08,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 692 transitions, 14662 flow [2024-06-28 00:37:10,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 692 transitions, 14545 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-28 00:37:10,754 INFO L231 Difference]: Finished difference. Result has 390 places, 659 transitions, 13057 flow [2024-06-28 00:37:10,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12765, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13057, PETRI_PLACES=390, PETRI_TRANSITIONS=659} [2024-06-28 00:37:10,755 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 348 predicate places. [2024-06-28 00:37:10,755 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 659 transitions, 13057 flow [2024-06-28 00:37:10,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:10,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:37:10,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:37:10,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-28 00:37:10,755 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:37:10,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:37:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -886575578, now seen corresponding path program 7 times [2024-06-28 00:37:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:37:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297309948] [2024-06-28 00:37:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:37:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:37:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:37:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:37:17,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:37:17,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297309948] [2024-06-28 00:37:17,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297309948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:37:17,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:37:17,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:37:17,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22646685] [2024-06-28 00:37:17,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:37:17,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:37:17,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:37:17,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:37:17,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:37:17,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:37:17,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 659 transitions, 13057 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:17,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:37:17,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:37:17,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:37:20,738 INFO L124 PetriNetUnfolderBase]: 4225/6961 cut-off events. [2024-06-28 00:37:20,738 INFO L125 PetriNetUnfolderBase]: For 548986/548992 co-relation queries the response was YES. [2024-06-28 00:37:20,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58953 conditions, 6961 events. 4225/6961 cut-off events. For 548986/548992 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 46731 event pairs, 1013 based on Foata normal form. 3/6959 useless extension candidates. Maximal degree in co-relation 58784. Up to 6248 conditions per place. [2024-06-28 00:37:20,841 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 552 selfloop transitions, 139 changer transitions 0/696 dead transitions. [2024-06-28 00:37:20,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 696 transitions, 14760 flow [2024-06-28 00:37:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:37:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:37:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 191 transitions. [2024-06-28 00:37:20,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3882113821138211 [2024-06-28 00:37:20,842 INFO L175 Difference]: Start difference. First operand has 390 places, 659 transitions, 13057 flow. Second operand 12 states and 191 transitions. [2024-06-28 00:37:20,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 696 transitions, 14760 flow [2024-06-28 00:37:23,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 696 transitions, 14491 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-28 00:37:23,125 INFO L231 Difference]: Finished difference. Result has 393 places, 659 transitions, 13076 flow [2024-06-28 00:37:23,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12788, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13076, PETRI_PLACES=393, PETRI_TRANSITIONS=659} [2024-06-28 00:37:23,126 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 351 predicate places. [2024-06-28 00:37:23,126 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 659 transitions, 13076 flow [2024-06-28 00:37:23,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:23,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:37:23,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:37:23,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-28 00:37:23,127 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:37:23,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:37:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1704589264, now seen corresponding path program 4 times [2024-06-28 00:37:23,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:37:23,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58638569] [2024-06-28 00:37:23,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:37:23,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:37:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:37:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:37:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:37:28,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58638569] [2024-06-28 00:37:28,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58638569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:37:28,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:37:28,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:37:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862800714] [2024-06-28 00:37:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:37:28,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:37:28,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:37:28,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:37:28,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:37:28,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:37:28,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 659 transitions, 13076 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:28,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:37:28,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:37:28,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:37:31,309 INFO L124 PetriNetUnfolderBase]: 4207/6932 cut-off events. [2024-06-28 00:37:31,310 INFO L125 PetriNetUnfolderBase]: For 556267/556278 co-relation queries the response was YES. [2024-06-28 00:37:31,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58281 conditions, 6932 events. 4207/6932 cut-off events. For 556267/556278 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 46412 event pairs, 1003 based on Foata normal form. 9/6935 useless extension candidates. Maximal degree in co-relation 58111. Up to 6306 conditions per place. [2024-06-28 00:37:31,415 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 602 selfloop transitions, 77 changer transitions 0/684 dead transitions. [2024-06-28 00:37:31,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 684 transitions, 14613 flow [2024-06-28 00:37:31,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:37:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:37:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2024-06-28 00:37:31,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3597560975609756 [2024-06-28 00:37:31,417 INFO L175 Difference]: Start difference. First operand has 393 places, 659 transitions, 13076 flow. Second operand 12 states and 177 transitions. [2024-06-28 00:37:31,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 684 transitions, 14613 flow [2024-06-28 00:37:33,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 684 transitions, 14268 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-28 00:37:33,598 INFO L231 Difference]: Finished difference. Result has 394 places, 660 transitions, 12922 flow [2024-06-28 00:37:33,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12731, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12922, PETRI_PLACES=394, PETRI_TRANSITIONS=660} [2024-06-28 00:37:33,598 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 352 predicate places. [2024-06-28 00:37:33,598 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 660 transitions, 12922 flow [2024-06-28 00:37:33,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:33,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:37:33,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:37:33,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-28 00:37:33,599 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:37:33,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:37:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1729795352, now seen corresponding path program 8 times [2024-06-28 00:37:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:37:33,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248377244] [2024-06-28 00:37:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:37:33,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:37:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:37:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:37:38,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:37:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248377244] [2024-06-28 00:37:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248377244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:37:38,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:37:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:37:38,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272068067] [2024-06-28 00:37:38,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:37:38,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:37:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:37:38,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:37:38,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:37:38,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:37:38,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 660 transitions, 12922 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:38,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:37:38,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:37:38,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:37:41,910 INFO L124 PetriNetUnfolderBase]: 4222/6968 cut-off events. [2024-06-28 00:37:41,911 INFO L125 PetriNetUnfolderBase]: For 552119/552132 co-relation queries the response was YES. [2024-06-28 00:37:41,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58477 conditions, 6968 events. 4222/6968 cut-off events. For 552119/552132 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 46859 event pairs, 973 based on Foata normal form. 6/6970 useless extension candidates. Maximal degree in co-relation 58305. Up to 6070 conditions per place. [2024-06-28 00:37:42,015 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 490 selfloop transitions, 205 changer transitions 0/700 dead transitions. [2024-06-28 00:37:42,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 700 transitions, 14791 flow [2024-06-28 00:37:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:37:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:37:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-06-28 00:37:42,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.401330376940133 [2024-06-28 00:37:42,017 INFO L175 Difference]: Start difference. First operand has 394 places, 660 transitions, 12922 flow. Second operand 11 states and 181 transitions. [2024-06-28 00:37:42,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 700 transitions, 14791 flow [2024-06-28 00:37:44,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 700 transitions, 14602 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-28 00:37:44,278 INFO L231 Difference]: Finished difference. Result has 397 places, 665 transitions, 13230 flow [2024-06-28 00:37:44,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12733, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13230, PETRI_PLACES=397, PETRI_TRANSITIONS=665} [2024-06-28 00:37:44,278 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 355 predicate places. [2024-06-28 00:37:44,278 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 665 transitions, 13230 flow [2024-06-28 00:37:44,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:44,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:37:44,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:37:44,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-28 00:37:44,279 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:37:44,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:37:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2102351894, now seen corresponding path program 9 times [2024-06-28 00:37:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:37:44,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207150958] [2024-06-28 00:37:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:37:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:37:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:37:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:37:49,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:37:49,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207150958] [2024-06-28 00:37:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207150958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:37:49,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:37:49,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:37:49,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913730013] [2024-06-28 00:37:49,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:37:49,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:37:49,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:37:49,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:37:49,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:37:49,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:37:49,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 665 transitions, 13230 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:49,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:37:49,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:37:49,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:37:52,672 INFO L124 PetriNetUnfolderBase]: 4253/7000 cut-off events. [2024-06-28 00:37:52,673 INFO L125 PetriNetUnfolderBase]: For 571902/571913 co-relation queries the response was YES. [2024-06-28 00:37:52,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59402 conditions, 7000 events. 4253/7000 cut-off events. For 571902/571913 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 46867 event pairs, 976 based on Foata normal form. 4/7000 useless extension candidates. Maximal degree in co-relation 59230. Up to 6099 conditions per place. [2024-06-28 00:37:52,779 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 490 selfloop transitions, 208 changer transitions 0/703 dead transitions. [2024-06-28 00:37:52,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 703 transitions, 15291 flow [2024-06-28 00:37:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:37:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:37:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-28 00:37:52,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924611973392461 [2024-06-28 00:37:52,781 INFO L175 Difference]: Start difference. First operand has 397 places, 665 transitions, 13230 flow. Second operand 11 states and 177 transitions. [2024-06-28 00:37:52,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 703 transitions, 15291 flow [2024-06-28 00:37:55,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 703 transitions, 14697 flow, removed 56 selfloop flow, removed 10 redundant places. [2024-06-28 00:37:55,281 INFO L231 Difference]: Finished difference. Result has 398 places, 673 transitions, 13202 flow [2024-06-28 00:37:55,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12690, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13202, PETRI_PLACES=398, PETRI_TRANSITIONS=673} [2024-06-28 00:37:55,282 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 356 predicate places. [2024-06-28 00:37:55,282 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 673 transitions, 13202 flow [2024-06-28 00:37:55,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:37:55,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:37:55,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:37:55,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-28 00:37:55,282 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:37:55,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:37:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2102341664, now seen corresponding path program 10 times [2024-06-28 00:37:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:37:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138004710] [2024-06-28 00:37:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:37:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:37:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:00,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138004710] [2024-06-28 00:38:00,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138004710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:00,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:00,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:38:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398590240] [2024-06-28 00:38:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:00,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:38:00,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:00,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:38:00,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:38:00,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:38:00,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 673 transitions, 13202 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:38:00,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:00,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:38:00,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:38:03,433 INFO L124 PetriNetUnfolderBase]: 4244/6996 cut-off events. [2024-06-28 00:38:03,434 INFO L125 PetriNetUnfolderBase]: For 572411/572422 co-relation queries the response was YES. [2024-06-28 00:38:03,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59002 conditions, 6996 events. 4244/6996 cut-off events. For 572411/572422 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 46965 event pairs, 974 based on Foata normal form. 4/6996 useless extension candidates. Maximal degree in co-relation 58830. Up to 6092 conditions per place. [2024-06-28 00:38:03,541 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 492 selfloop transitions, 209 changer transitions 0/706 dead transitions. [2024-06-28 00:38:03,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 706 transitions, 15010 flow [2024-06-28 00:38:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:38:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:38:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2024-06-28 00:38:03,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39227642276422764 [2024-06-28 00:38:03,542 INFO L175 Difference]: Start difference. First operand has 398 places, 673 transitions, 13202 flow. Second operand 12 states and 193 transitions. [2024-06-28 00:38:03,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 706 transitions, 15010 flow [2024-06-28 00:38:06,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 706 transitions, 14569 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-28 00:38:06,162 INFO L231 Difference]: Finished difference. Result has 403 places, 673 transitions, 13205 flow [2024-06-28 00:38:06,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12779, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13205, PETRI_PLACES=403, PETRI_TRANSITIONS=673} [2024-06-28 00:38:06,163 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 361 predicate places. [2024-06-28 00:38:06,163 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 673 transitions, 13205 flow [2024-06-28 00:38:06,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:38:06,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:38:06,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:38:06,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-28 00:38:06,164 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:38:06,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:38:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash -715585504, now seen corresponding path program 11 times [2024-06-28 00:38:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:38:06,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085206319] [2024-06-28 00:38:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:38:06,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:38:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:11,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:11,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085206319] [2024-06-28 00:38:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085206319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:11,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:11,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:38:11,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69000513] [2024-06-28 00:38:11,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:11,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:38:11,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:11,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:38:11,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:38:11,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:38:11,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 673 transitions, 13205 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:38:11,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:11,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:38:11,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:38:14,268 INFO L124 PetriNetUnfolderBase]: 4270/7032 cut-off events. [2024-06-28 00:38:14,268 INFO L125 PetriNetUnfolderBase]: For 587624/587635 co-relation queries the response was YES. [2024-06-28 00:38:14,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59531 conditions, 7032 events. 4270/7032 cut-off events. For 587624/587635 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 47142 event pairs, 972 based on Foata normal form. 3/7031 useless extension candidates. Maximal degree in co-relation 59358. Up to 6182 conditions per place. [2024-06-28 00:38:14,374 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 493 selfloop transitions, 204 changer transitions 0/702 dead transitions. [2024-06-28 00:38:14,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 702 transitions, 14975 flow [2024-06-28 00:38:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:38:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:38:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2024-06-28 00:38:14,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3678861788617886 [2024-06-28 00:38:14,375 INFO L175 Difference]: Start difference. First operand has 403 places, 673 transitions, 13205 flow. Second operand 12 states and 181 transitions. [2024-06-28 00:38:14,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 702 transitions, 14975 flow [2024-06-28 00:38:17,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 702 transitions, 14534 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-28 00:38:17,205 INFO L231 Difference]: Finished difference. Result has 404 places, 679 transitions, 13268 flow [2024-06-28 00:38:17,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12776, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13268, PETRI_PLACES=404, PETRI_TRANSITIONS=679} [2024-06-28 00:38:17,205 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 362 predicate places. [2024-06-28 00:38:17,205 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 679 transitions, 13268 flow [2024-06-28 00:38:17,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:38:17,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:38:17,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:38:17,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-28 00:38:17,206 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:38:17,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:38:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash -703610824, now seen corresponding path program 12 times [2024-06-28 00:38:17,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:38:17,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224569484] [2024-06-28 00:38:17,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:38:17,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:38:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:21,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224569484] [2024-06-28 00:38:21,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224569484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:21,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:21,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:38:21,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873168918] [2024-06-28 00:38:21,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:21,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:38:21,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:21,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:38:21,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:38:22,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:38:22,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 679 transitions, 13268 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:38:22,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:22,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:38:22,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:38:24,983 INFO L124 PetriNetUnfolderBase]: 4298/7066 cut-off events. [2024-06-28 00:38:24,984 INFO L125 PetriNetUnfolderBase]: For 603716/603716 co-relation queries the response was YES. [2024-06-28 00:38:25,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60068 conditions, 7066 events. 4298/7066 cut-off events. For 603716/603716 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 47444 event pairs, 976 based on Foata normal form. 3/7068 useless extension candidates. Maximal degree in co-relation 59894. Up to 5620 conditions per place. [2024-06-28 00:38:25,084 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 295 selfloop transitions, 462 changer transitions 0/762 dead transitions. [2024-06-28 00:38:25,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 762 transitions, 16135 flow [2024-06-28 00:38:25,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 00:38:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 00:38:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 234 transitions. [2024-06-28 00:38:25,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-28 00:38:25,086 INFO L175 Difference]: Start difference. First operand has 404 places, 679 transitions, 13268 flow. Second operand 14 states and 234 transitions. [2024-06-28 00:38:25,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 762 transitions, 16135 flow [2024-06-28 00:38:27,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 762 transitions, 15869 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-28 00:38:28,002 INFO L231 Difference]: Finished difference. Result has 413 places, 718 transitions, 14610 flow [2024-06-28 00:38:28,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13012, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=426, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14610, PETRI_PLACES=413, PETRI_TRANSITIONS=718} [2024-06-28 00:38:28,003 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 371 predicate places. [2024-06-28 00:38:28,003 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 718 transitions, 14610 flow [2024-06-28 00:38:28,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:38:28,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:38:28,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:38:28,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-28 00:38:28,003 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:38:28,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:38:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash -715575274, now seen corresponding path program 13 times [2024-06-28 00:38:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:38:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324429037] [2024-06-28 00:38:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:38:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:38:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324429037] [2024-06-28 00:38:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324429037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:33,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:38:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730935683] [2024-06-28 00:38:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:33,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:38:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:33,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:38:33,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:38:33,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:38:33,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 718 transitions, 14610 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:38:33,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:33,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:38:33,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:38:36,379 INFO L124 PetriNetUnfolderBase]: 4292/7083 cut-off events. [2024-06-28 00:38:36,379 INFO L125 PetriNetUnfolderBase]: For 629803/629814 co-relation queries the response was YES. [2024-06-28 00:38:36,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62385 conditions, 7083 events. 4292/7083 cut-off events. For 629803/629814 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 47719 event pairs, 976 based on Foata normal form. 3/7082 useless extension candidates. Maximal degree in co-relation 62207. Up to 6216 conditions per place. [2024-06-28 00:38:36,490 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 524 selfloop transitions, 208 changer transitions 0/737 dead transitions. [2024-06-28 00:38:36,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 737 transitions, 16180 flow [2024-06-28 00:38:36,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:38:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:38:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-28 00:38:36,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3829268292682927 [2024-06-28 00:38:36,491 INFO L175 Difference]: Start difference. First operand has 413 places, 718 transitions, 14610 flow. Second operand 10 states and 157 transitions. [2024-06-28 00:38:36,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 737 transitions, 16180 flow [2024-06-28 00:38:39,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 737 transitions, 15608 flow, removed 180 selfloop flow, removed 9 redundant places. [2024-06-28 00:38:39,666 INFO L231 Difference]: Finished difference. Result has 414 places, 718 transitions, 14482 flow [2024-06-28 00:38:39,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=14058, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14482, PETRI_PLACES=414, PETRI_TRANSITIONS=718} [2024-06-28 00:38:39,667 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 372 predicate places. [2024-06-28 00:38:39,667 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 718 transitions, 14482 flow [2024-06-28 00:38:39,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:38:39,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:38:39,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:38:39,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-28 00:38:39,668 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:38:39,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:38:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1960524852, now seen corresponding path program 2 times [2024-06-28 00:38:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:38:39,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9907042] [2024-06-28 00:38:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:38:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:38:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:44,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:44,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9907042] [2024-06-28 00:38:44,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9907042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:44,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:38:44,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032764107] [2024-06-28 00:38:44,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:44,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:38:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:44,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:38:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:38:44,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:38:44,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 718 transitions, 14482 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:38:44,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:44,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:38:44,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:38:47,112 INFO L124 PetriNetUnfolderBase]: 4300/7079 cut-off events. [2024-06-28 00:38:47,112 INFO L125 PetriNetUnfolderBase]: For 633069/633080 co-relation queries the response was YES. [2024-06-28 00:38:47,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61489 conditions, 7079 events. 4300/7079 cut-off events. For 633069/633080 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 47480 event pairs, 1009 based on Foata normal form. 3/7076 useless extension candidates. Maximal degree in co-relation 61311. Up to 6497 conditions per place. [2024-06-28 00:38:47,213 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 638 selfloop transitions, 90 changer transitions 0/733 dead transitions. [2024-06-28 00:38:47,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 733 transitions, 16016 flow [2024-06-28 00:38:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:38:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:38:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-28 00:38:47,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-28 00:38:47,214 INFO L175 Difference]: Start difference. First operand has 414 places, 718 transitions, 14482 flow. Second operand 9 states and 135 transitions. [2024-06-28 00:38:47,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 733 transitions, 16016 flow [2024-06-28 00:38:50,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 733 transitions, 15600 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 00:38:50,330 INFO L231 Difference]: Finished difference. Result has 414 places, 720 transitions, 14293 flow [2024-06-28 00:38:50,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=14066, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14293, PETRI_PLACES=414, PETRI_TRANSITIONS=720} [2024-06-28 00:38:50,331 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 372 predicate places. [2024-06-28 00:38:50,331 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 720 transitions, 14293 flow [2024-06-28 00:38:50,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:38:50,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:38:50,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:38:50,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-28 00:38:50,331 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:38:50,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:38:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1442270258, now seen corresponding path program 3 times [2024-06-28 00:38:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:38:50,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439834586] [2024-06-28 00:38:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:38:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:38:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:55,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439834586] [2024-06-28 00:38:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439834586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:55,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:55,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:38:55,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033337893] [2024-06-28 00:38:55,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:55,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:38:55,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:55,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:38:55,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:38:55,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:38:55,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 720 transitions, 14293 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:38:55,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:55,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:38:55,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:38:59,049 INFO L124 PetriNetUnfolderBase]: 4295/7076 cut-off events. [2024-06-28 00:38:59,049 INFO L125 PetriNetUnfolderBase]: For 635693/635704 co-relation queries the response was YES. [2024-06-28 00:38:59,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61089 conditions, 7076 events. 4295/7076 cut-off events. For 635693/635704 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 47500 event pairs, 1017 based on Foata normal form. 3/7073 useless extension candidates. Maximal degree in co-relation 60910. Up to 6458 conditions per place. [2024-06-28 00:38:59,154 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 642 selfloop transitions, 92 changer transitions 0/739 dead transitions. [2024-06-28 00:38:59,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 739 transitions, 15866 flow [2024-06-28 00:38:59,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:38:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:38:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-06-28 00:38:59,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-28 00:38:59,155 INFO L175 Difference]: Start difference. First operand has 414 places, 720 transitions, 14293 flow. Second operand 11 states and 164 transitions. [2024-06-28 00:38:59,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 739 transitions, 15866 flow [2024-06-28 00:39:02,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 739 transitions, 15661 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 00:39:02,240 INFO L231 Difference]: Finished difference. Result has 418 places, 721 transitions, 14301 flow [2024-06-28 00:39:02,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=14088, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14301, PETRI_PLACES=418, PETRI_TRANSITIONS=721} [2024-06-28 00:39:02,240 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 376 predicate places. [2024-06-28 00:39:02,240 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 721 transitions, 14301 flow [2024-06-28 00:39:02,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:39:02,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:02,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:02,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-28 00:39:02,241 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:39:02,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1316878806, now seen corresponding path program 4 times [2024-06-28 00:39:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:02,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188143594] [2024-06-28 00:39:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:06,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:06,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188143594] [2024-06-28 00:39:06,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188143594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:06,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:06,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:39:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750125813] [2024-06-28 00:39:06,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:06,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:39:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:39:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:39:06,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:39:06,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 721 transitions, 14301 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:39:06,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:06,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:39:06,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:09,329 INFO L124 PetriNetUnfolderBase]: 4290/7071 cut-off events. [2024-06-28 00:39:09,329 INFO L125 PetriNetUnfolderBase]: For 639359/639370 co-relation queries the response was YES. [2024-06-28 00:39:09,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60999 conditions, 7071 events. 4290/7071 cut-off events. For 639359/639370 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 47511 event pairs, 1007 based on Foata normal form. 3/7068 useless extension candidates. Maximal degree in co-relation 60819. Up to 6309 conditions per place. [2024-06-28 00:39:09,428 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 634 selfloop transitions, 102 changer transitions 0/741 dead transitions. [2024-06-28 00:39:09,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 741 transitions, 15921 flow [2024-06-28 00:39:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:39:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:39:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2024-06-28 00:39:09,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37669376693766937 [2024-06-28 00:39:09,429 INFO L175 Difference]: Start difference. First operand has 418 places, 721 transitions, 14301 flow. Second operand 9 states and 139 transitions. [2024-06-28 00:39:09,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 741 transitions, 15921 flow [2024-06-28 00:39:12,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 741 transitions, 15721 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-28 00:39:12,326 INFO L231 Difference]: Finished difference. Result has 420 places, 724 transitions, 14409 flow [2024-06-28 00:39:12,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=14107, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14409, PETRI_PLACES=420, PETRI_TRANSITIONS=724} [2024-06-28 00:39:12,326 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 378 predicate places. [2024-06-28 00:39:12,327 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 724 transitions, 14409 flow [2024-06-28 00:39:12,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-06-28 00:39:12,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:12,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:12,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-28 00:39:12,327 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:39:12,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash 393608376, now seen corresponding path program 14 times [2024-06-28 00:39:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14011098] [2024-06-28 00:39:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:16,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:16,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14011098] [2024-06-28 00:39:16,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14011098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:16,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:16,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:39:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550415471] [2024-06-28 00:39:16,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:16,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:39:16,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:16,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:39:16,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:39:17,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:39:17,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 724 transitions, 14409 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:39:17,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:17,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:39:17,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:19,834 INFO L124 PetriNetUnfolderBase]: 4284/7060 cut-off events. [2024-06-28 00:39:19,835 INFO L125 PetriNetUnfolderBase]: For 642921/642921 co-relation queries the response was YES. [2024-06-28 00:39:19,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61056 conditions, 7060 events. 4284/7060 cut-off events. For 642921/642921 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 47593 event pairs, 999 based on Foata normal form. 2/7059 useless extension candidates. Maximal degree in co-relation 60874. Up to 6403 conditions per place. [2024-06-28 00:39:19,947 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 633 selfloop transitions, 112 changer transitions 0/750 dead transitions. [2024-06-28 00:39:19,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 750 transitions, 16054 flow [2024-06-28 00:39:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:39:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:39:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-06-28 00:39:19,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3858093126385809 [2024-06-28 00:39:19,950 INFO L175 Difference]: Start difference. First operand has 420 places, 724 transitions, 14409 flow. Second operand 11 states and 174 transitions. [2024-06-28 00:39:19,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 750 transitions, 16054 flow [2024-06-28 00:39:23,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 750 transitions, 15826 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-28 00:39:23,772 INFO L231 Difference]: Finished difference. Result has 425 places, 724 transitions, 14411 flow [2024-06-28 00:39:23,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=14181, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14411, PETRI_PLACES=425, PETRI_TRANSITIONS=724} [2024-06-28 00:39:23,773 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 383 predicate places. [2024-06-28 00:39:23,773 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 724 transitions, 14411 flow [2024-06-28 00:39:23,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:39:23,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:23,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:23,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-28 00:39:23,773 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:39:23,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1642767708, now seen corresponding path program 15 times [2024-06-28 00:39:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968037578] [2024-06-28 00:39:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:23,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:28,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:28,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968037578] [2024-06-28 00:39:28,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968037578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:28,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:28,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:39:28,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898878027] [2024-06-28 00:39:28,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:28,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:39:28,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:28,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:39:28,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:39:28,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:39:28,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 724 transitions, 14411 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:39:28,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:28,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:39:28,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:31,071 INFO L124 PetriNetUnfolderBase]: 4294/7076 cut-off events. [2024-06-28 00:39:31,071 INFO L125 PetriNetUnfolderBase]: For 656304/656304 co-relation queries the response was YES. [2024-06-28 00:39:31,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61161 conditions, 7076 events. 4294/7076 cut-off events. For 656304/656304 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 47670 event pairs, 960 based on Foata normal form. 2/7077 useless extension candidates. Maximal degree in co-relation 60978. Up to 5900 conditions per place. [2024-06-28 00:39:31,176 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 446 selfloop transitions, 315 changer transitions 0/766 dead transitions. [2024-06-28 00:39:31,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 766 transitions, 16690 flow [2024-06-28 00:39:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:39:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:39:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 215 transitions. [2024-06-28 00:39:31,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40337711069418386 [2024-06-28 00:39:31,177 INFO L175 Difference]: Start difference. First operand has 425 places, 724 transitions, 14411 flow. Second operand 13 states and 215 transitions. [2024-06-28 00:39:31,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 766 transitions, 16690 flow [2024-06-28 00:39:34,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 766 transitions, 16342 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-28 00:39:34,861 INFO L231 Difference]: Finished difference. Result has 428 places, 731 transitions, 15019 flow [2024-06-28 00:39:34,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=14063, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15019, PETRI_PLACES=428, PETRI_TRANSITIONS=731} [2024-06-28 00:39:34,862 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 386 predicate places. [2024-06-28 00:39:34,862 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 731 transitions, 15019 flow [2024-06-28 00:39:34,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:39:34,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:34,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:34,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-28 00:39:34,863 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:39:34,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1138326978, now seen corresponding path program 16 times [2024-06-28 00:39:34,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:34,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106826240] [2024-06-28 00:39:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:40,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:40,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106826240] [2024-06-28 00:39:40,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106826240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:40,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:40,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:39:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817428947] [2024-06-28 00:39:40,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:40,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:39:40,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:40,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:39:40,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:39:40,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-28 00:39:40,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 731 transitions, 15019 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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-06-28 00:39:40,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:40,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-28 00:39:40,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:43,695 INFO L124 PetriNetUnfolderBase]: 4304/7085 cut-off events. [2024-06-28 00:39:43,695 INFO L125 PetriNetUnfolderBase]: For 683762/683773 co-relation queries the response was YES. [2024-06-28 00:39:43,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62079 conditions, 7085 events. 4304/7085 cut-off events. For 683762/683773 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 47507 event pairs, 1007 based on Foata normal form. 3/7082 useless extension candidates. Maximal degree in co-relation 61895. Up to 6398 conditions per place. [2024-06-28 00:39:43,798 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 612 selfloop transitions, 143 changer transitions 0/760 dead transitions. [2024-06-28 00:39:43,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 760 transitions, 17125 flow [2024-06-28 00:39:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 00:39:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 00:39:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 219 transitions. [2024-06-28 00:39:43,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35609756097560974 [2024-06-28 00:39:43,799 INFO L175 Difference]: Start difference. First operand has 428 places, 731 transitions, 15019 flow. Second operand 15 states and 219 transitions. [2024-06-28 00:39:43,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 760 transitions, 17125 flow Killed by 15