./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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:09:16,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:09:16,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:09:16,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:09:16,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:09:16,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:09:16,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:09:16,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:09:16,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:09:16,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:09:16,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:09:16,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:09:16,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:09:16,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:09:16,519 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:09:16,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:09:16,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:09:16,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:09:16,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:09:16,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:09:16,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:09:16,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:09:16,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:09:16,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:09:16,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:09:16,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:09:16,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:09:16,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:09:16,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:09:16,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:09:16,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:09:16,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:09:16,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:09:16,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:09:16,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:09:16,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:09:16,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:09:16,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:09:16,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:09:16,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:09:16,525 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:09:16,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:09:16,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:09:16,526 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:09:16,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:09:16,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:09:16,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:09:16,780 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:09:16,781 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:09:16,782 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-28 00:09:16,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:09:16,914 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:09:16,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 00:09:17,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:09:18,078 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:09:18,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 00:09:18,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29389c578/427f22211f5b429691ebd453d0e1bf9b/FLAG0845d9a92 [2024-06-28 00:09:18,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29389c578/427f22211f5b429691ebd453d0e1bf9b [2024-06-28 00:09:18,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:09:18,109 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:09:18,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:09:18,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:09:18,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:09:18,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:09:16" (1/2) ... [2024-06-28 00:09:18,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac7e14a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:18, skipping insertion in model container [2024-06-28 00:09:18,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:09:16" (1/2) ... [2024-06-28 00:09:18,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6fb30334 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:18, skipping insertion in model container [2024-06-28 00:09:18,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:09:18" (2/2) ... [2024-06-28 00:09:18,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac7e14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18, skipping insertion in model container [2024-06-28 00:09:18,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:09:18" (2/2) ... [2024-06-28 00:09:18,117 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:09:18,140 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:09:18,141 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )y$flush_delayed) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0_used >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff0_used >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff0_used >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0_used >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL) && (2LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) [2024-06-28 00:09:18,141 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )y$flush_delayed) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0_used >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff0_used >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff0_used >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0_used >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL) && (2LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) [2024-06-28 00:09:18,142 INFO L97 edCorrectnessWitness]: Location invariant before [L852-L852] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )y$flush_delayed) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0_used >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff0_used >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff0_used >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0_used >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL) && (2LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) [2024-06-28 00:09:18,142 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:09:18,142 INFO L106 edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1; [2024-06-28 00:09:18,179 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:09:18,517 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:09:18,532 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:09:18,745 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:09:18,778 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:09:18,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18 WrapperNode [2024-06-28 00:09:18,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:09:18,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:09:18,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:09:18,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:09:18,788 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:09:18" (1/1) ... [2024-06-28 00:09:18,808 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:09:18" (1/1) ... [2024-06-28 00:09:18,857 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-06-28 00:09:18,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:09:18,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:09:18,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:09:18,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:09:18,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,898 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 00:09:18,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:09:18,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:09:18,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:09:18,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:09:18,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (1/1) ... [2024-06-28 00:09:18,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:09:18,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:09:18,971 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:09:19,008 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:09:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:09:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:09:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 00:09:19,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 00:09:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 00:09:19,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 00:09:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 00:09:19,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 00:09:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:09:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:09:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:09:19,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:09:19,026 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:09:19,167 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:09:19,170 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:09:19,698 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:09:19,699 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:09:19,911 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:09:19,911 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 00:09:19,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:09:19 BoogieIcfgContainer [2024-06-28 00:09:19,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:09:19,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:09:19,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:09:19,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:09:19,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:09:16" (1/4) ... [2024-06-28 00:09:19,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ef7f1a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:09:19, skipping insertion in model container [2024-06-28 00:09:19,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:09:18" (2/4) ... [2024-06-28 00:09:19,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ef7f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:09:19, skipping insertion in model container [2024-06-28 00:09:19,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:18" (3/4) ... [2024-06-28 00:09:19,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ef7f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:09:19, skipping insertion in model container [2024-06-28 00:09:19,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:09:19" (4/4) ... [2024-06-28 00:09:19,925 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 00:09:19,942 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:09:19,942 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 00:09:19,943 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:09:19,999 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 00:09:20,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow [2024-06-28 00:09:20,076 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-06-28 00:09:20,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:09:20,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 00:09:20,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow [2024-06-28 00:09:20,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-06-28 00:09:20,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:09:20,133 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;@68e9ef7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:09:20,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-28 00:09:20,146 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:09:20,146 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 00:09:20,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:09:20,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:20,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:09:20,148 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:09:20,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 441899971, now seen corresponding path program 1 times [2024-06-28 00:09:20,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:20,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972296902] [2024-06-28 00:09:20,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:20,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:21,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:09:21,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:21,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972296902] [2024-06-28 00:09:21,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972296902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:21,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:21,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:09:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301297852] [2024-06-28 00:09:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:21,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:09:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:21,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:09:21,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:09:21,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-28 00:09:21,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:09:21,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:21,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-28 00:09:21,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:22,102 INFO L124 PetriNetUnfolderBase]: 1354/2038 cut-off events. [2024-06-28 00:09:22,102 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-28 00:09:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 2038 events. 1354/2038 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9585 event pairs, 709 based on Foata normal form. 4/2007 useless extension candidates. Maximal degree in co-relation 4138. Up to 2016 conditions per place. [2024-06-28 00:09:22,116 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 35 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-28 00:09:22,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 181 flow [2024-06-28 00:09:22,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:09:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:09:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-28 00:09:22,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-28 00:09:22,127 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 72 transitions. [2024-06-28 00:09:22,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 181 flow [2024-06-28 00:09:22,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 00:09:22,131 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow [2024-06-28 00:09:22,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-06-28 00:09:22,135 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2024-06-28 00:09:22,135 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow [2024-06-28 00:09:22,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:09:22,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:22,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:22,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:09:22,136 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:09:22,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:22,137 INFO L85 PathProgramCache]: Analyzing trace with hash -535779076, now seen corresponding path program 1 times [2024-06-28 00:09:22,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:22,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241644170] [2024-06-28 00:09:22,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:22,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:23,022 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:09:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:23,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241644170] [2024-06-28 00:09:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241644170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:23,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:09:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884478061] [2024-06-28 00:09:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:23,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:09:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:23,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:09:23,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:09:23,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-28 00:09:23,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:09:23,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:23,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-28 00:09:23,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:23,438 INFO L124 PetriNetUnfolderBase]: 1363/2050 cut-off events. [2024-06-28 00:09:23,438 INFO L125 PetriNetUnfolderBase]: For 316/319 co-relation queries the response was YES. [2024-06-28 00:09:23,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 2050 events. 1363/2050 cut-off events. For 316/319 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9433 event pairs, 772 based on Foata normal form. 8/2057 useless extension candidates. Maximal degree in co-relation 4726. Up to 2013 conditions per place. [2024-06-28 00:09:23,447 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 45 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2024-06-28 00:09:23,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 266 flow [2024-06-28 00:09:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:09:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:09:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-06-28 00:09:23,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-06-28 00:09:23,449 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 92 transitions. [2024-06-28 00:09:23,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 266 flow [2024-06-28 00:09:23,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:09:23,450 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 154 flow [2024-06-28 00:09:23,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-06-28 00:09:23,451 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2024-06-28 00:09:23,451 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 154 flow [2024-06-28 00:09:23,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:09:23,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:23,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:23,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:09:23,452 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:09:23,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash 570718658, now seen corresponding path program 1 times [2024-06-28 00:09:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872698679] [2024-06-28 00:09:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:24,489 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:09:24,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:24,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872698679] [2024-06-28 00:09:24,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872698679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:24,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:24,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:09:24,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561047340] [2024-06-28 00:09:24,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:24,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:09:24,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:24,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:09:24,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:09:24,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-28 00:09:24,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:09:24,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:24,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-28 00:09:24,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:24,989 INFO L124 PetriNetUnfolderBase]: 1664/2484 cut-off events. [2024-06-28 00:09:24,989 INFO L125 PetriNetUnfolderBase]: For 1152/1152 co-relation queries the response was YES. [2024-06-28 00:09:24,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6476 conditions, 2484 events. 1664/2484 cut-off events. For 1152/1152 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11396 event pairs, 791 based on Foata normal form. 6/2490 useless extension candidates. Maximal degree in co-relation 6461. Up to 2418 conditions per place. [2024-06-28 00:09:25,004 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 62 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2024-06-28 00:09:25,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 407 flow [2024-06-28 00:09:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:09:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:09:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-06-28 00:09:25,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555 [2024-06-28 00:09:25,007 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 154 flow. Second operand 5 states and 111 transitions. [2024-06-28 00:09:25,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 407 flow [2024-06-28 00:09:25,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 392 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-28 00:09:25,010 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 230 flow [2024-06-28 00:09:25,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2024-06-28 00:09:25,011 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2024-06-28 00:09:25,012 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 230 flow [2024-06-28 00:09:25,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:09:25,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:25,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:25,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:09:25,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:09:25,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash 429293185, now seen corresponding path program 1 times [2024-06-28 00:09:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:25,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268455806] [2024-06-28 00:09:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:26,400 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:09:26,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268455806] [2024-06-28 00:09:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268455806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:09:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717679926] [2024-06-28 00:09:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:26,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:09:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:26,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:09:26,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:09:26,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-28 00:09:26,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:09:26,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:26,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-28 00:09:26,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:26,948 INFO L124 PetriNetUnfolderBase]: 1658/2475 cut-off events. [2024-06-28 00:09:26,948 INFO L125 PetriNetUnfolderBase]: For 2199/2199 co-relation queries the response was YES. [2024-06-28 00:09:26,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7118 conditions, 2475 events. 1658/2475 cut-off events. For 2199/2199 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11209 event pairs, 722 based on Foata normal form. 3/2478 useless extension candidates. Maximal degree in co-relation 7099. Up to 2418 conditions per place. [2024-06-28 00:09:26,962 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 69 selfloop transitions, 13 changer transitions 0/86 dead transitions. [2024-06-28 00:09:26,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 507 flow [2024-06-28 00:09:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:09:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:09:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-06-28 00:09:26,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-06-28 00:09:26,967 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 230 flow. Second operand 6 states and 124 transitions. [2024-06-28 00:09:26,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 507 flow [2024-06-28 00:09:26,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 503 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 00:09:26,974 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 325 flow [2024-06-28 00:09:26,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2024-06-28 00:09:26,976 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-06-28 00:09:26,976 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 325 flow [2024-06-28 00:09:26,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:09:26,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:26,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:26,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:09:26,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:09:26,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1295155967, now seen corresponding path program 1 times [2024-06-28 00:09:26,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:26,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796279975] [2024-06-28 00:09:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:28,724 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:09:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796279975] [2024-06-28 00:09:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796279975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:28,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:28,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293926093] [2024-06-28 00:09:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:28,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:28,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:28,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-28 00:09:28,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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:09:28,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:28,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-28 00:09:28,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:29,343 INFO L124 PetriNetUnfolderBase]: 1649/2460 cut-off events. [2024-06-28 00:09:29,343 INFO L125 PetriNetUnfolderBase]: For 3519/3519 co-relation queries the response was YES. [2024-06-28 00:09:29,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7736 conditions, 2460 events. 1649/2460 cut-off events. For 3519/3519 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11068 event pairs, 558 based on Foata normal form. 6/2466 useless extension candidates. Maximal degree in co-relation 7712. Up to 2373 conditions per place. [2024-06-28 00:09:29,356 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 73 selfloop transitions, 15 changer transitions 0/92 dead transitions. [2024-06-28 00:09:29,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 587 flow [2024-06-28 00:09:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:09:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:09:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-28 00:09:29,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49642857142857144 [2024-06-28 00:09:29,359 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 325 flow. Second operand 7 states and 139 transitions. [2024-06-28 00:09:29,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 587 flow [2024-06-28 00:09:29,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 575 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-28 00:09:29,368 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 356 flow [2024-06-28 00:09:29,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2024-06-28 00:09:29,370 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2024-06-28 00:09:29,370 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 356 flow [2024-06-28 00:09:29,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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:09:29,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:29,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:29,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:09:29,375 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:09:29,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash 494709971, now seen corresponding path program 1 times [2024-06-28 00:09:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:29,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689978844] [2024-06-28 00:09:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:30,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:09:30,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:30,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689978844] [2024-06-28 00:09:30,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689978844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:30,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:09:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859872776] [2024-06-28 00:09:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:30,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:09:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:30,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:09:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:09:31,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:31,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:09:31,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:31,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:31,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:31,591 INFO L124 PetriNetUnfolderBase]: 1639/2459 cut-off events. [2024-06-28 00:09:31,591 INFO L125 PetriNetUnfolderBase]: For 5147/5149 co-relation queries the response was YES. [2024-06-28 00:09:31,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8174 conditions, 2459 events. 1639/2459 cut-off events. For 5147/5149 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11233 event pairs, 925 based on Foata normal form. 6/2465 useless extension candidates. Maximal degree in co-relation 8147. Up to 2407 conditions per place. [2024-06-28 00:09:31,608 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 60 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2024-06-28 00:09:31,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 560 flow [2024-06-28 00:09:31,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:09:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:09:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-06-28 00:09:31,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2024-06-28 00:09:31,610 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 356 flow. Second operand 5 states and 84 transitions. [2024-06-28 00:09:31,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 560 flow [2024-06-28 00:09:31,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 75 transitions, 523 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 00:09:31,617 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 396 flow [2024-06-28 00:09:31,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=396, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2024-06-28 00:09:31,620 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-06-28 00:09:31,620 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 396 flow [2024-06-28 00:09:31,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:09:31,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:31,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:31,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:09:31,621 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:09:31,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:31,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1639242506, now seen corresponding path program 1 times [2024-06-28 00:09:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:31,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885874316] [2024-06-28 00:09:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:33,247 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:09:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:33,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885874316] [2024-06-28 00:09:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885874316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:33,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:33,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:33,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622020162] [2024-06-28 00:09:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:33,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:33,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:33,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:33,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:33,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:33,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 396 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:33,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:33,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:33,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:34,175 INFO L124 PetriNetUnfolderBase]: 1672/2501 cut-off events. [2024-06-28 00:09:34,175 INFO L125 PetriNetUnfolderBase]: For 6275/6287 co-relation queries the response was YES. [2024-06-28 00:09:34,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8869 conditions, 2501 events. 1672/2501 cut-off events. For 6275/6287 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11374 event pairs, 643 based on Foata normal form. 14/2515 useless extension candidates. Maximal degree in co-relation 8838. Up to 2396 conditions per place. [2024-06-28 00:09:34,197 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 80 selfloop transitions, 28 changer transitions 0/111 dead transitions. [2024-06-28 00:09:34,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 111 transitions, 836 flow [2024-06-28 00:09:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:09:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:09:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-28 00:09:34,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-28 00:09:34,199 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 396 flow. Second operand 7 states and 130 transitions. [2024-06-28 00:09:34,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 111 transitions, 836 flow [2024-06-28 00:09:34,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 111 transitions, 818 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 00:09:34,205 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 591 flow [2024-06-28 00:09:34,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=591, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2024-06-28 00:09:34,206 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2024-06-28 00:09:34,206 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 591 flow [2024-06-28 00:09:34,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:34,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:34,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:34,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:09:34,207 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:09:34,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash -115667050, now seen corresponding path program 2 times [2024-06-28 00:09:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:34,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278205107] [2024-06-28 00:09:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:36,111 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:09:36,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278205107] [2024-06-28 00:09:36,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278205107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:36,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:36,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:36,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203891718] [2024-06-28 00:09:36,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:36,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:36,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:36,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:36,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:36,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:36,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 591 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:36,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:36,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:36,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:37,188 INFO L124 PetriNetUnfolderBase]: 1765/2649 cut-off events. [2024-06-28 00:09:37,188 INFO L125 PetriNetUnfolderBase]: For 9236/9242 co-relation queries the response was YES. [2024-06-28 00:09:37,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10400 conditions, 2649 events. 1765/2649 cut-off events. For 9236/9242 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12226 event pairs, 812 based on Foata normal form. 9/2658 useless extension candidates. Maximal degree in co-relation 10365. Up to 2474 conditions per place. [2024-06-28 00:09:37,206 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 83 selfloop transitions, 54 changer transitions 0/140 dead transitions. [2024-06-28 00:09:37,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 140 transitions, 1304 flow [2024-06-28 00:09:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:09:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:09:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-28 00:09:37,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-28 00:09:37,211 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 591 flow. Second operand 8 states and 139 transitions. [2024-06-28 00:09:37,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 140 transitions, 1304 flow [2024-06-28 00:09:37,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 140 transitions, 1243 flow, removed 27 selfloop flow, removed 1 redundant places. [2024-06-28 00:09:37,223 INFO L231 Difference]: Finished difference. Result has 83 places, 110 transitions, 990 flow [2024-06-28 00:09:37,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=990, PETRI_PLACES=83, PETRI_TRANSITIONS=110} [2024-06-28 00:09:37,225 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2024-06-28 00:09:37,225 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 110 transitions, 990 flow [2024-06-28 00:09:37,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:37,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:37,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:37,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:09:37,226 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:09:37,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:37,226 INFO L85 PathProgramCache]: Analyzing trace with hash 452781808, now seen corresponding path program 3 times [2024-06-28 00:09:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:37,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320023744] [2024-06-28 00:09:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:39,106 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:09:39,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:39,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320023744] [2024-06-28 00:09:39,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320023744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:39,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:39,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:39,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488763116] [2024-06-28 00:09:39,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:39,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:39,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:39,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:39,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:39,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:39,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 110 transitions, 990 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:39,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:39,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:39,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:40,107 INFO L124 PetriNetUnfolderBase]: 1774/2663 cut-off events. [2024-06-28 00:09:40,107 INFO L125 PetriNetUnfolderBase]: For 11523/11529 co-relation queries the response was YES. [2024-06-28 00:09:40,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11070 conditions, 2663 events. 1774/2663 cut-off events. For 11523/11529 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12327 event pairs, 856 based on Foata normal form. 9/2672 useless extension candidates. Maximal degree in co-relation 11029. Up to 2565 conditions per place. [2024-06-28 00:09:40,123 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 108 selfloop transitions, 30 changer transitions 0/141 dead transitions. [2024-06-28 00:09:40,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 141 transitions, 1426 flow [2024-06-28 00:09:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:09:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:09:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-28 00:09:40,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-28 00:09:40,125 INFO L175 Difference]: Start difference. First operand has 83 places, 110 transitions, 990 flow. Second operand 8 states and 130 transitions. [2024-06-28 00:09:40,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 141 transitions, 1426 flow [2024-06-28 00:09:40,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 141 transitions, 1344 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-28 00:09:40,143 INFO L231 Difference]: Finished difference. Result has 89 places, 117 transitions, 1073 flow [2024-06-28 00:09:40,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1073, PETRI_PLACES=89, PETRI_TRANSITIONS=117} [2024-06-28 00:09:40,143 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2024-06-28 00:09:40,143 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 117 transitions, 1073 flow [2024-06-28 00:09:40,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:40,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:40,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:40,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:09:40,144 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:09:40,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash 422308684, now seen corresponding path program 1 times [2024-06-28 00:09:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:40,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418902052] [2024-06-28 00:09:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:41,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:09:41,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418902052] [2024-06-28 00:09:41,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418902052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:41,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:41,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:41,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031343883] [2024-06-28 00:09:41,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:41,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:41,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:41,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:41,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:42,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:42,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 117 transitions, 1073 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:42,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:42,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:42,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:43,042 INFO L124 PetriNetUnfolderBase]: 1821/2731 cut-off events. [2024-06-28 00:09:43,042 INFO L125 PetriNetUnfolderBase]: For 13837/13839 co-relation queries the response was YES. [2024-06-28 00:09:43,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11527 conditions, 2731 events. 1821/2731 cut-off events. For 13837/13839 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12565 event pairs, 833 based on Foata normal form. 4/2734 useless extension candidates. Maximal degree in co-relation 11484. Up to 2580 conditions per place. [2024-06-28 00:09:43,061 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 118 selfloop transitions, 36 changer transitions 0/157 dead transitions. [2024-06-28 00:09:43,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 157 transitions, 1591 flow [2024-06-28 00:09:43,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:09:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:09:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-28 00:09:43,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-28 00:09:43,063 INFO L175 Difference]: Start difference. First operand has 89 places, 117 transitions, 1073 flow. Second operand 8 states and 139 transitions. [2024-06-28 00:09:43,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 157 transitions, 1591 flow [2024-06-28 00:09:43,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 157 transitions, 1488 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-28 00:09:43,084 INFO L231 Difference]: Finished difference. Result has 93 places, 130 transitions, 1147 flow [2024-06-28 00:09:43,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1147, PETRI_PLACES=93, PETRI_TRANSITIONS=130} [2024-06-28 00:09:43,085 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2024-06-28 00:09:43,085 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 130 transitions, 1147 flow [2024-06-28 00:09:43,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:43,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:43,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:43,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:09:43,086 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:09:43,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:43,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1502537544, now seen corresponding path program 4 times [2024-06-28 00:09:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:43,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130896759] [2024-06-28 00:09:43,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:43,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:44,431 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:09:44,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:44,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130896759] [2024-06-28 00:09:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130896759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880726862] [2024-06-28 00:09:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:44,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:44,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:44,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:44,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 130 transitions, 1147 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:44,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:44,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:44,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:45,145 INFO L124 PetriNetUnfolderBase]: 1972/2951 cut-off events. [2024-06-28 00:09:45,146 INFO L125 PetriNetUnfolderBase]: For 18031/18033 co-relation queries the response was YES. [2024-06-28 00:09:45,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13301 conditions, 2951 events. 1972/2951 cut-off events. For 18031/18033 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13749 event pairs, 888 based on Foata normal form. 8/2959 useless extension candidates. Maximal degree in co-relation 13257. Up to 2704 conditions per place. [2024-06-28 00:09:45,166 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 144 selfloop transitions, 53 changer transitions 0/200 dead transitions. [2024-06-28 00:09:45,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 200 transitions, 2084 flow [2024-06-28 00:09:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:09:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:09:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-28 00:09:45,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-28 00:09:45,168 INFO L175 Difference]: Start difference. First operand has 93 places, 130 transitions, 1147 flow. Second operand 7 states and 126 transitions. [2024-06-28 00:09:45,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 200 transitions, 2084 flow [2024-06-28 00:09:45,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 200 transitions, 2056 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-28 00:09:45,196 INFO L231 Difference]: Finished difference. Result has 100 places, 163 transitions, 1658 flow [2024-06-28 00:09:45,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1658, PETRI_PLACES=100, PETRI_TRANSITIONS=163} [2024-06-28 00:09:45,197 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2024-06-28 00:09:45,197 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 163 transitions, 1658 flow [2024-06-28 00:09:45,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:45,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:45,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:45,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:09:45,198 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:09:45,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:45,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1502417388, now seen corresponding path program 2 times [2024-06-28 00:09:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:45,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581199735] [2024-06-28 00:09:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:46,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:09:46,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:46,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581199735] [2024-06-28 00:09:46,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581199735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:46,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:46,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833856935] [2024-06-28 00:09:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:46,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:46,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:46,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:46,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:46,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 163 transitions, 1658 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:46,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:46,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:46,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:47,291 INFO L124 PetriNetUnfolderBase]: 2042/3057 cut-off events. [2024-06-28 00:09:47,291 INFO L125 PetriNetUnfolderBase]: For 23137/23139 co-relation queries the response was YES. [2024-06-28 00:09:47,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14879 conditions, 3057 events. 2042/3057 cut-off events. For 23137/23139 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14316 event pairs, 902 based on Foata normal form. 5/3061 useless extension candidates. Maximal degree in co-relation 14830. Up to 2857 conditions per place. [2024-06-28 00:09:47,308 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 158 selfloop transitions, 48 changer transitions 0/209 dead transitions. [2024-06-28 00:09:47,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 209 transitions, 2431 flow [2024-06-28 00:09:47,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:09:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:09:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 00:09:47,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 00:09:47,310 INFO L175 Difference]: Start difference. First operand has 100 places, 163 transitions, 1658 flow. Second operand 7 states and 120 transitions. [2024-06-28 00:09:47,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 209 transitions, 2431 flow [2024-06-28 00:09:47,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 209 transitions, 2396 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-28 00:09:47,343 INFO L231 Difference]: Finished difference. Result has 107 places, 184 transitions, 2003 flow [2024-06-28 00:09:47,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1623, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2003, PETRI_PLACES=107, PETRI_TRANSITIONS=184} [2024-06-28 00:09:47,344 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2024-06-28 00:09:47,344 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 184 transitions, 2003 flow [2024-06-28 00:09:47,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:47,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:47,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:47,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:09:47,345 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:09:47,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1989392580, now seen corresponding path program 5 times [2024-06-28 00:09:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:47,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079452857] [2024-06-28 00:09:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:47,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:48,615 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:09:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079452857] [2024-06-28 00:09:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079452857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566488338] [2024-06-28 00:09:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:48,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:48,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:48,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:48,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 184 transitions, 2003 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:48,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:48,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:48,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:49,372 INFO L124 PetriNetUnfolderBase]: 2097/3136 cut-off events. [2024-06-28 00:09:49,372 INFO L125 PetriNetUnfolderBase]: For 27690/27692 co-relation queries the response was YES. [2024-06-28 00:09:49,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16216 conditions, 3136 events. 2097/3136 cut-off events. For 27690/27692 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14726 event pairs, 892 based on Foata normal form. 9/3145 useless extension candidates. Maximal degree in co-relation 16163. Up to 2957 conditions per place. [2024-06-28 00:09:49,394 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 179 selfloop transitions, 43 changer transitions 0/225 dead transitions. [2024-06-28 00:09:49,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 225 transitions, 2726 flow [2024-06-28 00:09:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:09:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:09:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-28 00:09:49,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-28 00:09:49,395 INFO L175 Difference]: Start difference. First operand has 107 places, 184 transitions, 2003 flow. Second operand 7 states and 122 transitions. [2024-06-28 00:09:49,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 225 transitions, 2726 flow [2024-06-28 00:09:49,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 225 transitions, 2669 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-28 00:09:49,435 INFO L231 Difference]: Finished difference. Result has 113 places, 197 transitions, 2235 flow [2024-06-28 00:09:49,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2235, PETRI_PLACES=113, PETRI_TRANSITIONS=197} [2024-06-28 00:09:49,435 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2024-06-28 00:09:49,436 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 197 transitions, 2235 flow [2024-06-28 00:09:49,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:49,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:49,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:49,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:09:49,436 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:09:49,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2105206216, now seen corresponding path program 6 times [2024-06-28 00:09:49,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:49,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719486955] [2024-06-28 00:09:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:50,611 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:09:50,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:50,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719486955] [2024-06-28 00:09:50,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719486955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:50,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:50,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:50,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453275053] [2024-06-28 00:09:50,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:50,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:50,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:50,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:50,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:50,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 197 transitions, 2235 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:50,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:50,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:50,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:51,401 INFO L124 PetriNetUnfolderBase]: 2077/3104 cut-off events. [2024-06-28 00:09:51,401 INFO L125 PetriNetUnfolderBase]: For 30414/30414 co-relation queries the response was YES. [2024-06-28 00:09:51,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16451 conditions, 3104 events. 2077/3104 cut-off events. For 30414/30414 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14499 event pairs, 897 based on Foata normal form. 7/3111 useless extension candidates. Maximal degree in co-relation 16395. Up to 2996 conditions per place. [2024-06-28 00:09:51,425 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 193 selfloop transitions, 26 changer transitions 0/222 dead transitions. [2024-06-28 00:09:51,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 222 transitions, 2795 flow [2024-06-28 00:09:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:09:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:09:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-28 00:09:51,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-28 00:09:51,427 INFO L175 Difference]: Start difference. First operand has 113 places, 197 transitions, 2235 flow. Second operand 7 states and 116 transitions. [2024-06-28 00:09:51,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 222 transitions, 2795 flow [2024-06-28 00:09:51,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 222 transitions, 2648 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-06-28 00:09:51,472 INFO L231 Difference]: Finished difference. Result has 116 places, 197 transitions, 2168 flow [2024-06-28 00:09:51,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2168, PETRI_PLACES=116, PETRI_TRANSITIONS=197} [2024-06-28 00:09:51,473 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2024-06-28 00:09:51,473 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 197 transitions, 2168 flow [2024-06-28 00:09:51,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:51,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:51,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:51,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:09:51,473 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:09:51,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1248006996, now seen corresponding path program 3 times [2024-06-28 00:09:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564839977] [2024-06-28 00:09:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:52,552 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:09:52,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:52,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564839977] [2024-06-28 00:09:52,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564839977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:52,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217655004] [2024-06-28 00:09:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:52,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:52,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:52,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 197 transitions, 2168 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:52,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:52,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:52,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:53,241 INFO L124 PetriNetUnfolderBase]: 2106/3146 cut-off events. [2024-06-28 00:09:53,241 INFO L125 PetriNetUnfolderBase]: For 32846/32846 co-relation queries the response was YES. [2024-06-28 00:09:53,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16768 conditions, 3146 events. 2106/3146 cut-off events. For 32846/32846 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14696 event pairs, 901 based on Foata normal form. 5/3151 useless extension candidates. Maximal degree in co-relation 16711. Up to 3054 conditions per place. [2024-06-28 00:09:53,264 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 201 selfloop transitions, 23 changer transitions 0/227 dead transitions. [2024-06-28 00:09:53,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 227 transitions, 2807 flow [2024-06-28 00:09:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:09:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:09:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-28 00:09:53,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-28 00:09:53,265 INFO L175 Difference]: Start difference. First operand has 116 places, 197 transitions, 2168 flow. Second operand 7 states and 112 transitions. [2024-06-28 00:09:53,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 227 transitions, 2807 flow [2024-06-28 00:09:53,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 227 transitions, 2744 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 00:09:53,313 INFO L231 Difference]: Finished difference. Result has 120 places, 206 transitions, 2282 flow [2024-06-28 00:09:53,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2282, PETRI_PLACES=120, PETRI_TRANSITIONS=206} [2024-06-28 00:09:53,314 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places. [2024-06-28 00:09:53,314 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 206 transitions, 2282 flow [2024-06-28 00:09:53,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:53,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:53,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:53,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:09:53,315 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:09:53,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1325285868, now seen corresponding path program 4 times [2024-06-28 00:09:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:53,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408585122] [2024-06-28 00:09:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:54,528 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:09:54,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408585122] [2024-06-28 00:09:54,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408585122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:54,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:54,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:54,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327938927] [2024-06-28 00:09:54,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:54,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:54,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:54,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:54,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:54,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 206 transitions, 2282 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:54,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:54,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:54,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:55,311 INFO L124 PetriNetUnfolderBase]: 2093/3130 cut-off events. [2024-06-28 00:09:55,311 INFO L125 PetriNetUnfolderBase]: For 35596/35596 co-relation queries the response was YES. [2024-06-28 00:09:55,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16834 conditions, 3130 events. 2093/3130 cut-off events. For 35596/35596 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14628 event pairs, 895 based on Foata normal form. 5/3135 useless extension candidates. Maximal degree in co-relation 16776. Up to 2985 conditions per place. [2024-06-28 00:09:55,333 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 194 selfloop transitions, 40 changer transitions 0/237 dead transitions. [2024-06-28 00:09:55,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 237 transitions, 2985 flow [2024-06-28 00:09:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:09:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:09:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-28 00:09:55,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2024-06-28 00:09:55,335 INFO L175 Difference]: Start difference. First operand has 120 places, 206 transitions, 2282 flow. Second operand 7 states and 117 transitions. [2024-06-28 00:09:55,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 237 transitions, 2985 flow [2024-06-28 00:09:55,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 237 transitions, 2922 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-28 00:09:55,379 INFO L231 Difference]: Finished difference. Result has 124 places, 210 transitions, 2370 flow [2024-06-28 00:09:55,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2219, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2370, PETRI_PLACES=124, PETRI_TRANSITIONS=210} [2024-06-28 00:09:55,380 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2024-06-28 00:09:55,380 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 210 transitions, 2370 flow [2024-06-28 00:09:55,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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:09:55,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:55,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:55,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 00:09:55,381 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:09:55,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1325039790, now seen corresponding path program 1 times [2024-06-28 00:09:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:55,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492974683] [2024-06-28 00:09:55,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:55,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:57,068 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:09:57,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:57,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492974683] [2024-06-28 00:09:57,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492974683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:57,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:57,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:57,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663279482] [2024-06-28 00:09:57,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:57,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:57,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:57,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:57,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:57,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:09:57,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 210 transitions, 2370 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:09:57,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:57,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:09:57,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:57,804 INFO L124 PetriNetUnfolderBase]: 2085/3117 cut-off events. [2024-06-28 00:09:57,805 INFO L125 PetriNetUnfolderBase]: For 38825/38829 co-relation queries the response was YES. [2024-06-28 00:09:57,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16990 conditions, 3117 events. 2085/3117 cut-off events. For 38825/38829 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14600 event pairs, 884 based on Foata normal form. 8/3125 useless extension candidates. Maximal degree in co-relation 16931. Up to 3029 conditions per place. [2024-06-28 00:09:57,827 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 208 selfloop transitions, 16 changer transitions 0/227 dead transitions. [2024-06-28 00:09:57,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 227 transitions, 2896 flow [2024-06-28 00:09:57,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:09:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:09:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-28 00:09:57,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-28 00:09:57,829 INFO L175 Difference]: Start difference. First operand has 124 places, 210 transitions, 2370 flow. Second operand 7 states and 105 transitions. [2024-06-28 00:09:57,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 227 transitions, 2896 flow [2024-06-28 00:09:57,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 227 transitions, 2793 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-28 00:09:57,883 INFO L231 Difference]: Finished difference. Result has 127 places, 212 transitions, 2332 flow [2024-06-28 00:09:57,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2332, PETRI_PLACES=127, PETRI_TRANSITIONS=212} [2024-06-28 00:09:57,884 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places. [2024-06-28 00:09:57,884 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 212 transitions, 2332 flow [2024-06-28 00:09:57,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:09:57,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:57,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:57,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 00:09:57,884 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:09:57,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1350875793, now seen corresponding path program 1 times [2024-06-28 00:09:57,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:57,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335309637] [2024-06-28 00:09:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:59,338 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:09:59,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:59,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335309637] [2024-06-28 00:09:59,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335309637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:59,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:59,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:09:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104238640] [2024-06-28 00:09:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:59,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:09:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:59,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:09:59,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:09:59,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:09:59,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 212 transitions, 2332 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:09:59,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:59,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:09:59,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:00,363 INFO L124 PetriNetUnfolderBase]: 2034/3083 cut-off events. [2024-06-28 00:10:00,363 INFO L125 PetriNetUnfolderBase]: For 44698/44766 co-relation queries the response was YES. [2024-06-28 00:10:00,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17083 conditions, 3083 events. 2034/3083 cut-off events. For 44698/44766 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15047 event pairs, 633 based on Foata normal form. 36/3087 useless extension candidates. Maximal degree in co-relation 17023. Up to 2326 conditions per place. [2024-06-28 00:10:00,382 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 116 selfloop transitions, 114 changer transitions 0/265 dead transitions. [2024-06-28 00:10:00,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 265 transitions, 3251 flow [2024-06-28 00:10:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-28 00:10:00,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478125 [2024-06-28 00:10:00,383 INFO L175 Difference]: Start difference. First operand has 127 places, 212 transitions, 2332 flow. Second operand 8 states and 153 transitions. [2024-06-28 00:10:00,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 265 transitions, 3251 flow [2024-06-28 00:10:00,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 265 transitions, 3192 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-28 00:10:00,436 INFO L231 Difference]: Finished difference. Result has 133 places, 232 transitions, 2855 flow [2024-06-28 00:10:00,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2855, PETRI_PLACES=133, PETRI_TRANSITIONS=232} [2024-06-28 00:10:00,437 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 92 predicate places. [2024-06-28 00:10:00,437 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 232 transitions, 2855 flow [2024-06-28 00:10:00,437 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:10:00,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:00,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:00,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:10:00,437 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:10:00,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash -753652075, now seen corresponding path program 2 times [2024-06-28 00:10:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606296463] [2024-06-28 00:10:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:02,232 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:10:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:02,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606296463] [2024-06-28 00:10:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606296463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:02,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:02,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679618264] [2024-06-28 00:10:02,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:02,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:02,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:02,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:10:02,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 232 transitions, 2855 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:10:02,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:02,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:10:02,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:03,098 INFO L124 PetriNetUnfolderBase]: 2250/3361 cut-off events. [2024-06-28 00:10:03,099 INFO L125 PetriNetUnfolderBase]: For 53890/53901 co-relation queries the response was YES. [2024-06-28 00:10:03,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20602 conditions, 3361 events. 2250/3361 cut-off events. For 53890/53901 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15930 event pairs, 709 based on Foata normal form. 9/3370 useless extension candidates. Maximal degree in co-relation 20539. Up to 2619 conditions per place. [2024-06-28 00:10:03,126 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 162 selfloop transitions, 129 changer transitions 0/294 dead transitions. [2024-06-28 00:10:03,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 294 transitions, 4134 flow [2024-06-28 00:10:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:10:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:10:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-28 00:10:03,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-28 00:10:03,129 INFO L175 Difference]: Start difference. First operand has 133 places, 232 transitions, 2855 flow. Second operand 7 states and 150 transitions. [2024-06-28 00:10:03,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 294 transitions, 4134 flow [2024-06-28 00:10:03,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 294 transitions, 3950 flow, removed 80 selfloop flow, removed 3 redundant places. [2024-06-28 00:10:03,201 INFO L231 Difference]: Finished difference. Result has 138 places, 252 transitions, 3344 flow [2024-06-28 00:10:03,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2777, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3344, PETRI_PLACES=138, PETRI_TRANSITIONS=252} [2024-06-28 00:10:03,201 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 97 predicate places. [2024-06-28 00:10:03,201 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 252 transitions, 3344 flow [2024-06-28 00:10:03,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:10:03,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:03,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:03,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:10:03,202 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:10:03,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash -216742289, now seen corresponding path program 3 times [2024-06-28 00:10:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802118514] [2024-06-28 00:10:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:03,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:04,905 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:10:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:04,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802118514] [2024-06-28 00:10:04,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802118514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:04,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:04,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121554525] [2024-06-28 00:10:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:04,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:04,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:04,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:04,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:04,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:10:04,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 252 transitions, 3344 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:10:04,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:04,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:10:04,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:05,875 INFO L124 PetriNetUnfolderBase]: 2362/3526 cut-off events. [2024-06-28 00:10:05,875 INFO L125 PetriNetUnfolderBase]: For 58650/58661 co-relation queries the response was YES. [2024-06-28 00:10:05,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22436 conditions, 3526 events. 2362/3526 cut-off events. For 58650/58661 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16854 event pairs, 718 based on Foata normal form. 15/3541 useless extension candidates. Maximal degree in co-relation 22372. Up to 2856 conditions per place. [2024-06-28 00:10:05,907 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 177 selfloop transitions, 130 changer transitions 0/310 dead transitions. [2024-06-28 00:10:05,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 310 transitions, 4584 flow [2024-06-28 00:10:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:10:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:10:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-28 00:10:05,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 00:10:05,909 INFO L175 Difference]: Start difference. First operand has 138 places, 252 transitions, 3344 flow. Second operand 7 states and 148 transitions. [2024-06-28 00:10:05,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 310 transitions, 4584 flow [2024-06-28 00:10:05,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 310 transitions, 4459 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-06-28 00:10:05,984 INFO L231 Difference]: Finished difference. Result has 143 places, 267 transitions, 3720 flow [2024-06-28 00:10:05,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3227, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3720, PETRI_PLACES=143, PETRI_TRANSITIONS=267} [2024-06-28 00:10:05,984 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2024-06-28 00:10:05,985 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 267 transitions, 3720 flow [2024-06-28 00:10:05,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:10:05,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:05,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:05,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:10:05,985 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:10:05,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash 202943946, now seen corresponding path program 1 times [2024-06-28 00:10:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892618035] [2024-06-28 00:10:05,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:05,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:08,323 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:10:08,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:08,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892618035] [2024-06-28 00:10:08,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892618035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:08,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:08,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942678016] [2024-06-28 00:10:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:08,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:08,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:08,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 267 transitions, 3720 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:08,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:08,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:08,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:09,627 INFO L124 PetriNetUnfolderBase]: 2449/3653 cut-off events. [2024-06-28 00:10:09,628 INFO L125 PetriNetUnfolderBase]: For 65524/65535 co-relation queries the response was YES. [2024-06-28 00:10:09,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24238 conditions, 3653 events. 2449/3653 cut-off events. For 65524/65535 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17525 event pairs, 705 based on Foata normal form. 9/3662 useless extension candidates. Maximal degree in co-relation 24172. Up to 3153 conditions per place. [2024-06-28 00:10:09,659 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 198 selfloop transitions, 130 changer transitions 0/331 dead transitions. [2024-06-28 00:10:09,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 331 transitions, 5132 flow [2024-06-28 00:10:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-28 00:10:09,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-06-28 00:10:09,661 INFO L175 Difference]: Start difference. First operand has 143 places, 267 transitions, 3720 flow. Second operand 8 states and 154 transitions. [2024-06-28 00:10:09,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 331 transitions, 5132 flow [2024-06-28 00:10:09,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 331 transitions, 4821 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-28 00:10:09,746 INFO L231 Difference]: Finished difference. Result has 149 places, 297 transitions, 4241 flow [2024-06-28 00:10:09,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3454, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4241, PETRI_PLACES=149, PETRI_TRANSITIONS=297} [2024-06-28 00:10:09,747 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 108 predicate places. [2024-06-28 00:10:09,747 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 297 transitions, 4241 flow [2024-06-28 00:10:09,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:09,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:09,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:09,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 00:10:09,747 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:10:09,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1151335626, now seen corresponding path program 2 times [2024-06-28 00:10:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:09,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678429211] [2024-06-28 00:10:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:11,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:10:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678429211] [2024-06-28 00:10:11,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678429211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:11,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:11,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425176169] [2024-06-28 00:10:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:11,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:12,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:12,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 297 transitions, 4241 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:12,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:12,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:12,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:13,252 INFO L124 PetriNetUnfolderBase]: 2477/3694 cut-off events. [2024-06-28 00:10:13,252 INFO L125 PetriNetUnfolderBase]: For 70736/70743 co-relation queries the response was YES. [2024-06-28 00:10:13,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25203 conditions, 3694 events. 2477/3694 cut-off events. For 70736/70743 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17771 event pairs, 755 based on Foata normal form. 5/3699 useless extension candidates. Maximal degree in co-relation 25134. Up to 3434 conditions per place. [2024-06-28 00:10:13,279 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 257 selfloop transitions, 80 changer transitions 0/340 dead transitions. [2024-06-28 00:10:13,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 340 transitions, 5392 flow [2024-06-28 00:10:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-28 00:10:13,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-28 00:10:13,280 INFO L175 Difference]: Start difference. First operand has 149 places, 297 transitions, 4241 flow. Second operand 8 states and 150 transitions. [2024-06-28 00:10:13,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 340 transitions, 5392 flow [2024-06-28 00:10:13,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 340 transitions, 5309 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-06-28 00:10:13,367 INFO L231 Difference]: Finished difference. Result has 155 places, 306 transitions, 4480 flow [2024-06-28 00:10:13,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4166, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4480, PETRI_PLACES=155, PETRI_TRANSITIONS=306} [2024-06-28 00:10:13,368 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 114 predicate places. [2024-06-28 00:10:13,368 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 306 transitions, 4480 flow [2024-06-28 00:10:13,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:13,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:13,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:13,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 00:10:13,368 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:10:13,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:13,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1120954386, now seen corresponding path program 3 times [2024-06-28 00:10:13,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:13,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205304013] [2024-06-28 00:10:13,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:15,552 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:10:15,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:15,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205304013] [2024-06-28 00:10:15,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205304013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:15,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:15,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:15,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214367702] [2024-06-28 00:10:15,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:15,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:15,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:15,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:15,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:15,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 306 transitions, 4480 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:15,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:15,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:15,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:17,035 INFO L124 PetriNetUnfolderBase]: 2469/3683 cut-off events. [2024-06-28 00:10:17,035 INFO L125 PetriNetUnfolderBase]: For 75551/75558 co-relation queries the response was YES. [2024-06-28 00:10:17,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25506 conditions, 3683 events. 2469/3683 cut-off events. For 75551/75558 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17681 event pairs, 756 based on Foata normal form. 5/3688 useless extension candidates. Maximal degree in co-relation 25435. Up to 3426 conditions per place. [2024-06-28 00:10:17,065 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 260 selfloop transitions, 82 changer transitions 0/345 dead transitions. [2024-06-28 00:10:17,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 345 transitions, 5444 flow [2024-06-28 00:10:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:10:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:10:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-28 00:10:17,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.435 [2024-06-28 00:10:17,067 INFO L175 Difference]: Start difference. First operand has 155 places, 306 transitions, 4480 flow. Second operand 10 states and 174 transitions. [2024-06-28 00:10:17,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 345 transitions, 5444 flow [2024-06-28 00:10:17,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 345 transitions, 5314 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-28 00:10:17,193 INFO L231 Difference]: Finished difference. Result has 161 places, 306 transitions, 4526 flow [2024-06-28 00:10:17,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4350, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4526, PETRI_PLACES=161, PETRI_TRANSITIONS=306} [2024-06-28 00:10:17,194 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places. [2024-06-28 00:10:17,194 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 306 transitions, 4526 flow [2024-06-28 00:10:17,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:17,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:17,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:17,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 00:10:17,194 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:10:17,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1120954603, now seen corresponding path program 1 times [2024-06-28 00:10:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:17,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179881579] [2024-06-28 00:10:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:19,204 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:10:19,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179881579] [2024-06-28 00:10:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179881579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:19,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:19,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902910067] [2024-06-28 00:10:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:19,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:19,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:19,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 306 transitions, 4526 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:19,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:19,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:19,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:20,252 INFO L124 PetriNetUnfolderBase]: 2492/3716 cut-off events. [2024-06-28 00:10:20,252 INFO L125 PetriNetUnfolderBase]: For 80008/80015 co-relation queries the response was YES. [2024-06-28 00:10:20,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26143 conditions, 3716 events. 2492/3716 cut-off events. For 80008/80015 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17859 event pairs, 759 based on Foata normal form. 4/3720 useless extension candidates. Maximal degree in co-relation 26070. Up to 3450 conditions per place. [2024-06-28 00:10:20,286 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 258 selfloop transitions, 85 changer transitions 0/346 dead transitions. [2024-06-28 00:10:20,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 346 transitions, 5601 flow [2024-06-28 00:10:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 00:10:20,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-28 00:10:20,288 INFO L175 Difference]: Start difference. First operand has 161 places, 306 transitions, 4526 flow. Second operand 8 states and 140 transitions. [2024-06-28 00:10:20,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 346 transitions, 5601 flow [2024-06-28 00:10:20,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 346 transitions, 5415 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-28 00:10:20,427 INFO L231 Difference]: Finished difference. Result has 161 places, 319 transitions, 4725 flow [2024-06-28 00:10:20,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4340, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4725, PETRI_PLACES=161, PETRI_TRANSITIONS=319} [2024-06-28 00:10:20,427 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places. [2024-06-28 00:10:20,427 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 319 transitions, 4725 flow [2024-06-28 00:10:20,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:20,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:20,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:20,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 00:10:20,428 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:20,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:20,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1120948651, now seen corresponding path program 4 times [2024-06-28 00:10:20,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:20,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206028138] [2024-06-28 00:10:20,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:20,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:22,383 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:10:22,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206028138] [2024-06-28 00:10:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206028138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:22,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091146813] [2024-06-28 00:10:22,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:22,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:22,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:22,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:22,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:22,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:10:22,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 319 transitions, 4725 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:10:22,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:22,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:10:22,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:23,428 INFO L124 PetriNetUnfolderBase]: 2595/3863 cut-off events. [2024-06-28 00:10:23,429 INFO L125 PetriNetUnfolderBase]: For 90131/90137 co-relation queries the response was YES. [2024-06-28 00:10:23,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27458 conditions, 3863 events. 2595/3863 cut-off events. For 90131/90137 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18670 event pairs, 738 based on Foata normal form. 12/3875 useless extension candidates. Maximal degree in co-relation 27382. Up to 3468 conditions per place. [2024-06-28 00:10:23,466 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 302 selfloop transitions, 77 changer transitions 0/382 dead transitions. [2024-06-28 00:10:23,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 382 transitions, 6066 flow [2024-06-28 00:10:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-28 00:10:23,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478125 [2024-06-28 00:10:23,467 INFO L175 Difference]: Start difference. First operand has 161 places, 319 transitions, 4725 flow. Second operand 8 states and 153 transitions. [2024-06-28 00:10:23,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 382 transitions, 6066 flow [2024-06-28 00:10:23,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 382 transitions, 5871 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-28 00:10:23,616 INFO L231 Difference]: Finished difference. Result has 167 places, 341 transitions, 5028 flow [2024-06-28 00:10:23,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4542, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5028, PETRI_PLACES=167, PETRI_TRANSITIONS=341} [2024-06-28 00:10:23,616 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places. [2024-06-28 00:10:23,617 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 341 transitions, 5028 flow [2024-06-28 00:10:23,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:10:23,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:23,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:23,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 00:10:23,617 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:23,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash -469429534, now seen corresponding path program 4 times [2024-06-28 00:10:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:23,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538562076] [2024-06-28 00:10:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:23,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:24,944 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:10:24,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:24,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538562076] [2024-06-28 00:10:24,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538562076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:24,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:24,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:24,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067921345] [2024-06-28 00:10:24,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:24,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:24,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:25,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:25,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 341 transitions, 5028 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:25,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:25,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:25,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:25,900 INFO L124 PetriNetUnfolderBase]: 2656/3954 cut-off events. [2024-06-28 00:10:25,901 INFO L125 PetriNetUnfolderBase]: For 94208/94213 co-relation queries the response was YES. [2024-06-28 00:10:25,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29378 conditions, 3954 events. 2656/3954 cut-off events. For 94208/94213 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 19204 event pairs, 858 based on Foata normal form. 6/3960 useless extension candidates. Maximal degree in co-relation 29299. Up to 3449 conditions per place. [2024-06-28 00:10:25,946 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 265 selfloop transitions, 133 changer transitions 0/401 dead transitions. [2024-06-28 00:10:25,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 401 transitions, 6583 flow [2024-06-28 00:10:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 00:10:25,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-28 00:10:25,948 INFO L175 Difference]: Start difference. First operand has 167 places, 341 transitions, 5028 flow. Second operand 8 states and 140 transitions. [2024-06-28 00:10:25,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 401 transitions, 6583 flow [2024-06-28 00:10:26,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 401 transitions, 6508 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-06-28 00:10:26,122 INFO L231 Difference]: Finished difference. Result has 175 places, 366 transitions, 5756 flow [2024-06-28 00:10:26,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4953, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5756, PETRI_PLACES=175, PETRI_TRANSITIONS=366} [2024-06-28 00:10:26,123 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places. [2024-06-28 00:10:26,123 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 366 transitions, 5756 flow [2024-06-28 00:10:26,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:26,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:26,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:26,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 00:10:26,124 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:26,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash -465704884, now seen corresponding path program 5 times [2024-06-28 00:10:26,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:26,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344663724] [2024-06-28 00:10:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:27,462 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:10:27,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:27,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344663724] [2024-06-28 00:10:27,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344663724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:27,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:27,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:27,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097217068] [2024-06-28 00:10:27,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:27,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:27,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:27,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:27,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:27,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:27,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 366 transitions, 5756 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:27,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:27,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:27,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:28,658 INFO L124 PetriNetUnfolderBase]: 2761/4111 cut-off events. [2024-06-28 00:10:28,658 INFO L125 PetriNetUnfolderBase]: For 107605/107610 co-relation queries the response was YES. [2024-06-28 00:10:28,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31824 conditions, 4111 events. 2761/4111 cut-off events. For 107605/107610 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20159 event pairs, 866 based on Foata normal form. 7/4118 useless extension candidates. Maximal degree in co-relation 31741. Up to 3739 conditions per place. [2024-06-28 00:10:28,696 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 325 selfloop transitions, 113 changer transitions 0/441 dead transitions. [2024-06-28 00:10:28,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 441 transitions, 7692 flow [2024-06-28 00:10:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:10:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:10:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 00:10:28,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415 [2024-06-28 00:10:28,697 INFO L175 Difference]: Start difference. First operand has 175 places, 366 transitions, 5756 flow. Second operand 10 states and 166 transitions. [2024-06-28 00:10:28,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 441 transitions, 7692 flow [2024-06-28 00:10:28,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 441 transitions, 7428 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-28 00:10:28,873 INFO L231 Difference]: Finished difference. Result has 182 places, 393 transitions, 6364 flow [2024-06-28 00:10:28,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5519, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6364, PETRI_PLACES=182, PETRI_TRANSITIONS=393} [2024-06-28 00:10:28,874 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places. [2024-06-28 00:10:28,874 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 393 transitions, 6364 flow [2024-06-28 00:10:28,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:28,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:28,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:28,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 00:10:28,874 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:28,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2042516334, now seen corresponding path program 6 times [2024-06-28 00:10:28,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:28,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641191171] [2024-06-28 00:10:28,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:28,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:30,188 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:10:30,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:30,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641191171] [2024-06-28 00:10:30,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641191171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:30,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840956599] [2024-06-28 00:10:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:30,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:30,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:30,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:30,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 393 transitions, 6364 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:30,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:30,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:30,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:31,337 INFO L124 PetriNetUnfolderBase]: 2742/4086 cut-off events. [2024-06-28 00:10:31,337 INFO L125 PetriNetUnfolderBase]: For 112209/112214 co-relation queries the response was YES. [2024-06-28 00:10:31,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31677 conditions, 4086 events. 2742/4086 cut-off events. For 112209/112214 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20000 event pairs, 862 based on Foata normal form. 7/4093 useless extension candidates. Maximal degree in co-relation 31592. Up to 3724 conditions per place. [2024-06-28 00:10:31,372 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 320 selfloop transitions, 110 changer transitions 0/433 dead transitions. [2024-06-28 00:10:31,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 433 transitions, 7595 flow [2024-06-28 00:10:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-28 00:10:31,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43125 [2024-06-28 00:10:31,373 INFO L175 Difference]: Start difference. First operand has 182 places, 393 transitions, 6364 flow. Second operand 8 states and 138 transitions. [2024-06-28 00:10:31,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 433 transitions, 7595 flow [2024-06-28 00:10:31,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 433 transitions, 7340 flow, removed 87 selfloop flow, removed 4 redundant places. [2024-06-28 00:10:31,544 INFO L231 Difference]: Finished difference. Result has 186 places, 393 transitions, 6351 flow [2024-06-28 00:10:31,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6109, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6351, PETRI_PLACES=186, PETRI_TRANSITIONS=393} [2024-06-28 00:10:31,544 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 145 predicate places. [2024-06-28 00:10:31,544 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 393 transitions, 6351 flow [2024-06-28 00:10:31,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:31,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:31,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:31,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 00:10:31,545 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:31,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash -836881790, now seen corresponding path program 7 times [2024-06-28 00:10:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078160088] [2024-06-28 00:10:31,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:32,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:10:32,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:32,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078160088] [2024-06-28 00:10:32,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078160088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:32,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:32,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667760557] [2024-06-28 00:10:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:32,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:32,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:32,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:32,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:32,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 393 transitions, 6351 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:32,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:32,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:32,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:33,867 INFO L124 PetriNetUnfolderBase]: 2785/4144 cut-off events. [2024-06-28 00:10:33,868 INFO L125 PetriNetUnfolderBase]: For 117907/117907 co-relation queries the response was YES. [2024-06-28 00:10:33,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32618 conditions, 4144 events. 2785/4144 cut-off events. For 117907/117907 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20313 event pairs, 868 based on Foata normal form. 7/4151 useless extension candidates. Maximal degree in co-relation 32530. Up to 3827 conditions per place. [2024-06-28 00:10:33,915 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 361 selfloop transitions, 80 changer transitions 0/444 dead transitions. [2024-06-28 00:10:33,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 444 transitions, 7963 flow [2024-06-28 00:10:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 00:10:33,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-28 00:10:33,916 INFO L175 Difference]: Start difference. First operand has 186 places, 393 transitions, 6351 flow. Second operand 8 states and 135 transitions. [2024-06-28 00:10:33,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 444 transitions, 7963 flow [2024-06-28 00:10:34,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 444 transitions, 7743 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 00:10:34,115 INFO L231 Difference]: Finished difference. Result has 187 places, 405 transitions, 6579 flow [2024-06-28 00:10:34,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6131, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6579, PETRI_PLACES=187, PETRI_TRANSITIONS=405} [2024-06-28 00:10:34,115 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 146 predicate places. [2024-06-28 00:10:34,116 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 405 transitions, 6579 flow [2024-06-28 00:10:34,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:34,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:34,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:34,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 00:10:34,116 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:34,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1865806597, now seen corresponding path program 5 times [2024-06-28 00:10:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811696991] [2024-06-28 00:10:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:35,551 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:10:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811696991] [2024-06-28 00:10:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811696991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:35,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80149483] [2024-06-28 00:10:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:35,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:35,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:35,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:35,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:35,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:35,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 405 transitions, 6579 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:35,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:35,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:35,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:36,711 INFO L124 PetriNetUnfolderBase]: 2838/4233 cut-off events. [2024-06-28 00:10:36,711 INFO L125 PetriNetUnfolderBase]: For 125180/125185 co-relation queries the response was YES. [2024-06-28 00:10:36,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33346 conditions, 4233 events. 2838/4233 cut-off events. For 125180/125185 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20943 event pairs, 868 based on Foata normal form. 9/4242 useless extension candidates. Maximal degree in co-relation 33257. Up to 3861 conditions per place. [2024-06-28 00:10:36,757 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 363 selfloop transitions, 85 changer transitions 0/451 dead transitions. [2024-06-28 00:10:36,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 451 transitions, 8051 flow [2024-06-28 00:10:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:10:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:10:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-28 00:10:36,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2024-06-28 00:10:36,759 INFO L175 Difference]: Start difference. First operand has 187 places, 405 transitions, 6579 flow. Second operand 7 states and 129 transitions. [2024-06-28 00:10:36,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 451 transitions, 8051 flow [2024-06-28 00:10:37,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 451 transitions, 7684 flow, removed 77 selfloop flow, removed 7 redundant places. [2024-06-28 00:10:37,018 INFO L231 Difference]: Finished difference. Result has 189 places, 422 transitions, 6719 flow [2024-06-28 00:10:37,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6212, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6719, PETRI_PLACES=189, PETRI_TRANSITIONS=422} [2024-06-28 00:10:37,019 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places. [2024-06-28 00:10:37,019 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 422 transitions, 6719 flow [2024-06-28 00:10:37,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:37,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:37,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:37,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 00:10:37,020 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:37,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:37,020 INFO L85 PathProgramCache]: Analyzing trace with hash -829257433, now seen corresponding path program 2 times [2024-06-28 00:10:37,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:37,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723840571] [2024-06-28 00:10:37,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:38,228 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:10:38,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:38,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723840571] [2024-06-28 00:10:38,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723840571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:38,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802375068] [2024-06-28 00:10:38,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:38,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:38,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:38,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 422 transitions, 6719 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:38,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:38,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:38,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:39,234 INFO L124 PetriNetUnfolderBase]: 2830/4214 cut-off events. [2024-06-28 00:10:39,234 INFO L125 PetriNetUnfolderBase]: For 129343/129347 co-relation queries the response was YES. [2024-06-28 00:10:39,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33371 conditions, 4214 events. 2830/4214 cut-off events. For 129343/129347 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 20715 event pairs, 886 based on Foata normal form. 7/4221 useless extension candidates. Maximal degree in co-relation 33281. Up to 4080 conditions per place. [2024-06-28 00:10:39,273 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 406 selfloop transitions, 30 changer transitions 0/439 dead transitions. [2024-06-28 00:10:39,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 439 transitions, 7683 flow [2024-06-28 00:10:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:10:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:10:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-28 00:10:39,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-28 00:10:39,275 INFO L175 Difference]: Start difference. First operand has 189 places, 422 transitions, 6719 flow. Second operand 6 states and 99 transitions. [2024-06-28 00:10:39,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 439 transitions, 7683 flow [2024-06-28 00:10:39,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 439 transitions, 7394 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-28 00:10:39,507 INFO L231 Difference]: Finished difference. Result has 190 places, 422 transitions, 6514 flow [2024-06-28 00:10:39,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6432, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6514, PETRI_PLACES=190, PETRI_TRANSITIONS=422} [2024-06-28 00:10:39,508 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 149 predicate places. [2024-06-28 00:10:39,508 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 422 transitions, 6514 flow [2024-06-28 00:10:39,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:39,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:39,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:39,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 00:10:39,508 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:39,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash -836876210, now seen corresponding path program 8 times [2024-06-28 00:10:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:39,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706286546] [2024-06-28 00:10:39,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:40,710 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:10:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706286546] [2024-06-28 00:10:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706286546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811700073] [2024-06-28 00:10:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:40,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:40,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:40,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:40,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:40,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 422 transitions, 6514 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:40,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:40,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:40,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:42,002 INFO L124 PetriNetUnfolderBase]: 2873/4279 cut-off events. [2024-06-28 00:10:42,002 INFO L125 PetriNetUnfolderBase]: For 135743/135743 co-relation queries the response was YES. [2024-06-28 00:10:42,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33730 conditions, 4279 events. 2873/4279 cut-off events. For 135743/135743 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21141 event pairs, 876 based on Foata normal form. 7/4286 useless extension candidates. Maximal degree in co-relation 33639. Up to 3938 conditions per place. [2024-06-28 00:10:42,049 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 386 selfloop transitions, 86 changer transitions 0/475 dead transitions. [2024-06-28 00:10:42,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 475 transitions, 8127 flow [2024-06-28 00:10:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 00:10:42,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-28 00:10:42,052 INFO L175 Difference]: Start difference. First operand has 190 places, 422 transitions, 6514 flow. Second operand 8 states and 134 transitions. [2024-06-28 00:10:42,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 475 transitions, 8127 flow [2024-06-28 00:10:42,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 475 transitions, 8057 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-28 00:10:42,312 INFO L231 Difference]: Finished difference. Result has 194 places, 434 transitions, 6887 flow [2024-06-28 00:10:42,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6452, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6887, PETRI_PLACES=194, PETRI_TRANSITIONS=434} [2024-06-28 00:10:42,313 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 153 predicate places. [2024-06-28 00:10:42,313 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 434 transitions, 6887 flow [2024-06-28 00:10:42,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:42,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:42,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:42,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 00:10:42,313 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:42,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1873163982, now seen corresponding path program 9 times [2024-06-28 00:10:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:42,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218773020] [2024-06-28 00:10:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:42,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:43,610 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:10:43,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:43,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218773020] [2024-06-28 00:10:43,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218773020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:43,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:43,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680558808] [2024-06-28 00:10:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:43,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:43,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:43,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 434 transitions, 6887 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:43,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:43,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:43,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:44,805 INFO L124 PetriNetUnfolderBase]: 2851/4245 cut-off events. [2024-06-28 00:10:44,805 INFO L125 PetriNetUnfolderBase]: For 133486/133486 co-relation queries the response was YES. [2024-06-28 00:10:44,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33483 conditions, 4245 events. 2851/4245 cut-off events. For 133486/133486 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20880 event pairs, 882 based on Foata normal form. 7/4252 useless extension candidates. Maximal degree in co-relation 33391. Up to 4081 conditions per place. [2024-06-28 00:10:44,851 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 428 selfloop transitions, 38 changer transitions 0/469 dead transitions. [2024-06-28 00:10:44,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 469 transitions, 8138 flow [2024-06-28 00:10:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-28 00:10:44,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-28 00:10:44,854 INFO L175 Difference]: Start difference. First operand has 194 places, 434 transitions, 6887 flow. Second operand 8 states and 127 transitions. [2024-06-28 00:10:44,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 469 transitions, 8138 flow [2024-06-28 00:10:45,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 469 transitions, 7943 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-28 00:10:45,126 INFO L231 Difference]: Finished difference. Result has 197 places, 440 transitions, 6949 flow [2024-06-28 00:10:45,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6698, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6949, PETRI_PLACES=197, PETRI_TRANSITIONS=440} [2024-06-28 00:10:45,127 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places. [2024-06-28 00:10:45,127 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 440 transitions, 6949 flow [2024-06-28 00:10:45,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 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:10:45,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:45,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:45,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 00:10:45,127 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:45,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1888945963, now seen corresponding path program 1 times [2024-06-28 00:10:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966732430] [2024-06-28 00:10:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:45,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:46,629 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:10:46,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:46,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966732430] [2024-06-28 00:10:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966732430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:46,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:46,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:10:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824892431] [2024-06-28 00:10:46,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:46,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:10:46,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:10:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:10:46,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-28 00:10:46,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 440 transitions, 6949 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:10:46,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:46,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-28 00:10:46,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:48,079 INFO L124 PetriNetUnfolderBase]: 2476/3907 cut-off events. [2024-06-28 00:10:48,079 INFO L125 PetriNetUnfolderBase]: For 154651/154824 co-relation queries the response was YES. [2024-06-28 00:10:48,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31825 conditions, 3907 events. 2476/3907 cut-off events. For 154651/154824 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21654 event pairs, 402 based on Foata normal form. 65/3899 useless extension candidates. Maximal degree in co-relation 31732. Up to 1762 conditions per place. [2024-06-28 00:10:48,118 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 143 selfloop transitions, 222 changer transitions 0/484 dead transitions. [2024-06-28 00:10:48,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 484 transitions, 8159 flow [2024-06-28 00:10:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-06-28 00:10:48,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51875 [2024-06-28 00:10:48,120 INFO L175 Difference]: Start difference. First operand has 197 places, 440 transitions, 6949 flow. Second operand 8 states and 166 transitions. [2024-06-28 00:10:48,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 484 transitions, 8159 flow [2024-06-28 00:10:48,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 484 transitions, 8033 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-28 00:10:48,411 INFO L231 Difference]: Finished difference. Result has 203 places, 450 transitions, 7703 flow [2024-06-28 00:10:48,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6823, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7703, PETRI_PLACES=203, PETRI_TRANSITIONS=450} [2024-06-28 00:10:48,412 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places. [2024-06-28 00:10:48,412 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 450 transitions, 7703 flow [2024-06-28 00:10:48,412 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:10:48,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:48,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:48,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 00:10:48,412 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:48,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash -714050477, now seen corresponding path program 1 times [2024-06-28 00:10:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:48,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061943934] [2024-06-28 00:10:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:48,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:50,250 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:10:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061943934] [2024-06-28 00:10:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061943934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:10:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016015063] [2024-06-28 00:10:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:50,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:10:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:50,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:10:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:10:50,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:10:50,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 450 transitions, 7703 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:10:50,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:50,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:10:50,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:51,491 INFO L124 PetriNetUnfolderBase]: 3024/4535 cut-off events. [2024-06-28 00:10:51,492 INFO L125 PetriNetUnfolderBase]: For 165804/165808 co-relation queries the response was YES. [2024-06-28 00:10:51,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37544 conditions, 4535 events. 3024/4535 cut-off events. For 165804/165808 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22964 event pairs, 940 based on Foata normal form. 4/4539 useless extension candidates. Maximal degree in co-relation 37447. Up to 4252 conditions per place. [2024-06-28 00:10:51,542 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 399 selfloop transitions, 75 changer transitions 0/477 dead transitions. [2024-06-28 00:10:51,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 477 transitions, 8809 flow [2024-06-28 00:10:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 00:10:51,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-28 00:10:51,544 INFO L175 Difference]: Start difference. First operand has 203 places, 450 transitions, 7703 flow. Second operand 8 states and 132 transitions. [2024-06-28 00:10:51,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 477 transitions, 8809 flow [2024-06-28 00:10:51,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 477 transitions, 8629 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-28 00:10:51,826 INFO L231 Difference]: Finished difference. Result has 207 places, 452 transitions, 7727 flow [2024-06-28 00:10:51,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7530, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7727, PETRI_PLACES=207, PETRI_TRANSITIONS=452} [2024-06-28 00:10:51,827 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 166 predicate places. [2024-06-28 00:10:51,827 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 452 transitions, 7727 flow [2024-06-28 00:10:51,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:10:51,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:51,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:51,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 00:10:51,827 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:51,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -943706683, now seen corresponding path program 2 times [2024-06-28 00:10:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629937750] [2024-06-28 00:10:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:53,707 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:10:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:53,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629937750] [2024-06-28 00:10:53,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629937750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:53,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:53,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:10:53,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525643137] [2024-06-28 00:10:53,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:53,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:10:53,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:53,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:10:53,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:10:53,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:10:53,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 452 transitions, 7727 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:10:53,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:53,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:10:53,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:55,079 INFO L124 PetriNetUnfolderBase]: 3252/4888 cut-off events. [2024-06-28 00:10:55,079 INFO L125 PetriNetUnfolderBase]: For 190543/190553 co-relation queries the response was YES. [2024-06-28 00:10:55,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40246 conditions, 4888 events. 3252/4888 cut-off events. For 190543/190553 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 25395 event pairs, 643 based on Foata normal form. 12/4900 useless extension candidates. Maximal degree in co-relation 40149. Up to 3151 conditions per place. [2024-06-28 00:10:55,132 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 217 selfloop transitions, 291 changer transitions 0/511 dead transitions. [2024-06-28 00:10:55,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 511 transitions, 9505 flow [2024-06-28 00:10:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:10:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:10:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-28 00:10:55,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-06-28 00:10:55,134 INFO L175 Difference]: Start difference. First operand has 207 places, 452 transitions, 7727 flow. Second operand 9 states and 178 transitions. [2024-06-28 00:10:55,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 511 transitions, 9505 flow [2024-06-28 00:10:55,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 511 transitions, 9336 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-28 00:10:55,449 INFO L231 Difference]: Finished difference. Result has 210 places, 460 transitions, 8274 flow [2024-06-28 00:10:55,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7558, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8274, PETRI_PLACES=210, PETRI_TRANSITIONS=460} [2024-06-28 00:10:55,450 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 169 predicate places. [2024-06-28 00:10:55,450 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 460 transitions, 8274 flow [2024-06-28 00:10:55,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:10:55,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:55,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:55,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 00:10:55,451 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:55,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash 923455979, now seen corresponding path program 1 times [2024-06-28 00:10:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248528525] [2024-06-28 00:10:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:57,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:10:57,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:57,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248528525] [2024-06-28 00:10:57,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248528525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:57,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:57,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:10:57,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038403293] [2024-06-28 00:10:57,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:57,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:10:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:10:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:10:57,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:10:57,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 460 transitions, 8274 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:10:57,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:57,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:10:57,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:58,834 INFO L124 PetriNetUnfolderBase]: 3288/4942 cut-off events. [2024-06-28 00:10:58,834 INFO L125 PetriNetUnfolderBase]: For 205326/205336 co-relation queries the response was YES. [2024-06-28 00:10:58,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41927 conditions, 4942 events. 3288/4942 cut-off events. For 205326/205336 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25771 event pairs, 849 based on Foata normal form. 12/4954 useless extension candidates. Maximal degree in co-relation 41829. Up to 3623 conditions per place. [2024-06-28 00:10:58,896 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 211 selfloop transitions, 294 changer transitions 0/508 dead transitions. [2024-06-28 00:10:58,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 508 transitions, 9838 flow [2024-06-28 00:10:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:10:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:10:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 00:10:58,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-28 00:10:58,898 INFO L175 Difference]: Start difference. First operand has 210 places, 460 transitions, 8274 flow. Second operand 9 states and 172 transitions. [2024-06-28 00:10:58,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 508 transitions, 9838 flow [2024-06-28 00:10:59,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 508 transitions, 9395 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-28 00:10:59,322 INFO L231 Difference]: Finished difference. Result has 214 places, 466 transitions, 8506 flow [2024-06-28 00:10:59,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7831, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8506, PETRI_PLACES=214, PETRI_TRANSITIONS=466} [2024-06-28 00:10:59,323 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places. [2024-06-28 00:10:59,323 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 466 transitions, 8506 flow [2024-06-28 00:10:59,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:10:59,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:59,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:59,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 00:10:59,323 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:59,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1888376503, now seen corresponding path program 3 times [2024-06-28 00:10:59,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:59,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629101217] [2024-06-28 00:10:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:01,372 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:11:01,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:01,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629101217] [2024-06-28 00:11:01,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629101217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:01,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:01,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794649035] [2024-06-28 00:11:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:01,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:01,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:11:01,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 466 transitions, 8506 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:01,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:01,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:11:01,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:02,914 INFO L124 PetriNetUnfolderBase]: 3316/4987 cut-off events. [2024-06-28 00:11:02,914 INFO L125 PetriNetUnfolderBase]: For 213106/213116 co-relation queries the response was YES. [2024-06-28 00:11:02,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42702 conditions, 4987 events. 3316/4987 cut-off events. For 213106/213116 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 26062 event pairs, 858 based on Foata normal form. 12/4999 useless extension candidates. Maximal degree in co-relation 42602. Up to 3716 conditions per place. [2024-06-28 00:11:02,974 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 222 selfloop transitions, 287 changer transitions 0/512 dead transitions. [2024-06-28 00:11:02,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 512 transitions, 10054 flow [2024-06-28 00:11:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:11:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:11:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-28 00:11:02,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-28 00:11:02,976 INFO L175 Difference]: Start difference. First operand has 214 places, 466 transitions, 8506 flow. Second operand 9 states and 171 transitions. [2024-06-28 00:11:02,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 512 transitions, 10054 flow [2024-06-28 00:11:03,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 512 transitions, 9541 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-28 00:11:03,464 INFO L231 Difference]: Finished difference. Result has 217 places, 469 transitions, 8628 flow [2024-06-28 00:11:03,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7993, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8628, PETRI_PLACES=217, PETRI_TRANSITIONS=469} [2024-06-28 00:11:03,465 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 176 predicate places. [2024-06-28 00:11:03,465 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 469 transitions, 8628 flow [2024-06-28 00:11:03,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:03,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:03,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:03,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 00:11:03,465 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:03,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:03,466 INFO L85 PathProgramCache]: Analyzing trace with hash -940902423, now seen corresponding path program 1 times [2024-06-28 00:11:03,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:03,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445224167] [2024-06-28 00:11:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:03,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:05,306 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:11:05,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:05,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445224167] [2024-06-28 00:11:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445224167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:05,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814725278] [2024-06-28 00:11:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:05,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:05,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:11:05,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 469 transitions, 8628 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:05,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:05,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:11:05,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:06,761 INFO L124 PetriNetUnfolderBase]: 3403/5108 cut-off events. [2024-06-28 00:11:06,762 INFO L125 PetriNetUnfolderBase]: For 225013/225023 co-relation queries the response was YES. [2024-06-28 00:11:06,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44627 conditions, 5108 events. 3403/5108 cut-off events. For 225013/225023 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26704 event pairs, 920 based on Foata normal form. 9/5117 useless extension candidates. Maximal degree in co-relation 44526. Up to 4278 conditions per place. [2024-06-28 00:11:06,822 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 251 selfloop transitions, 283 changer transitions 0/537 dead transitions. [2024-06-28 00:11:06,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 537 transitions, 10704 flow [2024-06-28 00:11:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:11:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:11:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 00:11:06,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-28 00:11:06,824 INFO L175 Difference]: Start difference. First operand has 217 places, 469 transitions, 8628 flow. Second operand 9 states and 160 transitions. [2024-06-28 00:11:06,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 537 transitions, 10704 flow [2024-06-28 00:11:07,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 537 transitions, 10041 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-28 00:11:07,200 INFO L231 Difference]: Finished difference. Result has 220 places, 503 transitions, 9343 flow [2024-06-28 00:11:07,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8031, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9343, PETRI_PLACES=220, PETRI_TRANSITIONS=503} [2024-06-28 00:11:07,201 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places. [2024-06-28 00:11:07,201 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 503 transitions, 9343 flow [2024-06-28 00:11:07,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:07,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:07,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:07,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 00:11:07,202 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:07,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash -971294079, now seen corresponding path program 2 times [2024-06-28 00:11:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:07,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667784287] [2024-06-28 00:11:07,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:07,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:09,120 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:11:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667784287] [2024-06-28 00:11:09,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667784287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:09,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:09,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478662515] [2024-06-28 00:11:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:09,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:09,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:09,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:09,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:09,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:11:09,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 503 transitions, 9343 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:09,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:09,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:11:09,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:10,486 INFO L124 PetriNetUnfolderBase]: 3439/5171 cut-off events. [2024-06-28 00:11:10,486 INFO L125 PetriNetUnfolderBase]: For 237521/237531 co-relation queries the response was YES. [2024-06-28 00:11:10,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45318 conditions, 5171 events. 3439/5171 cut-off events. For 237521/237531 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 27184 event pairs, 895 based on Foata normal form. 12/5183 useless extension candidates. Maximal degree in co-relation 45215. Up to 4179 conditions per place. [2024-06-28 00:11:10,548 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 260 selfloop transitions, 291 changer transitions 0/554 dead transitions. [2024-06-28 00:11:10,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 554 transitions, 11130 flow [2024-06-28 00:11:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:11:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:11:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-28 00:11:10,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-28 00:11:10,549 INFO L175 Difference]: Start difference. First operand has 220 places, 503 transitions, 9343 flow. Second operand 9 states and 170 transitions. [2024-06-28 00:11:10,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 554 transitions, 11130 flow [2024-06-28 00:11:10,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 554 transitions, 10731 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:10,956 INFO L231 Difference]: Finished difference. Result has 224 places, 509 transitions, 9625 flow [2024-06-28 00:11:10,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8944, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9625, PETRI_PLACES=224, PETRI_TRANSITIONS=509} [2024-06-28 00:11:10,957 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 183 predicate places. [2024-06-28 00:11:10,957 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 509 transitions, 9625 flow [2024-06-28 00:11:10,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:10,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:10,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:10,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 00:11:10,958 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:10,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1885579993, now seen corresponding path program 4 times [2024-06-28 00:11:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:10,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038950615] [2024-06-28 00:11:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:12,915 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:11:12,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:12,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038950615] [2024-06-28 00:11:12,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038950615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:12,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:12,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:12,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078488215] [2024-06-28 00:11:12,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:12,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:12,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:12,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:12,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:13,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:11:13,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 509 transitions, 9625 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:13,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:13,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:11:13,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:14,445 INFO L124 PetriNetUnfolderBase]: 3603/5446 cut-off events. [2024-06-28 00:11:14,445 INFO L125 PetriNetUnfolderBase]: For 273721/273731 co-relation queries the response was YES. [2024-06-28 00:11:14,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47243 conditions, 5446 events. 3603/5446 cut-off events. For 273721/273731 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29187 event pairs, 938 based on Foata normal form. 42/5488 useless extension candidates. Maximal degree in co-relation 47139. Up to 4243 conditions per place. [2024-06-28 00:11:14,512 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 270 selfloop transitions, 288 changer transitions 0/561 dead transitions. [2024-06-28 00:11:14,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 561 transitions, 11424 flow [2024-06-28 00:11:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:11:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:11:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-28 00:11:14,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-06-28 00:11:14,513 INFO L175 Difference]: Start difference. First operand has 224 places, 509 transitions, 9625 flow. Second operand 9 states and 173 transitions. [2024-06-28 00:11:14,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 561 transitions, 11424 flow [2024-06-28 00:11:14,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 561 transitions, 10987 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-28 00:11:14,997 INFO L231 Difference]: Finished difference. Result has 227 places, 512 transitions, 9831 flow [2024-06-28 00:11:14,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9188, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9831, PETRI_PLACES=227, PETRI_TRANSITIONS=512} [2024-06-28 00:11:14,997 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 186 predicate places. [2024-06-28 00:11:14,997 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 512 transitions, 9831 flow [2024-06-28 00:11:14,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:14,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:14,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:14,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 00:11:14,998 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:14,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:14,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2107119047, now seen corresponding path program 2 times [2024-06-28 00:11:14,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:14,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727173735] [2024-06-28 00:11:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:14,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:17,213 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:11:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727173735] [2024-06-28 00:11:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727173735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:17,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932525639] [2024-06-28 00:11:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:17,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:17,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:11:17,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 512 transitions, 9831 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:17,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:17,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:11:17,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:18,796 INFO L124 PetriNetUnfolderBase]: 3626/5459 cut-off events. [2024-06-28 00:11:18,796 INFO L125 PetriNetUnfolderBase]: For 262869/262879 co-relation queries the response was YES. [2024-06-28 00:11:18,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47964 conditions, 5459 events. 3626/5459 cut-off events. For 262869/262879 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29100 event pairs, 945 based on Foata normal form. 10/5469 useless extension candidates. Maximal degree in co-relation 47859. Up to 4618 conditions per place. [2024-06-28 00:11:18,865 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 268 selfloop transitions, 297 changer transitions 0/568 dead transitions. [2024-06-28 00:11:18,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 568 transitions, 11939 flow [2024-06-28 00:11:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:11:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:11:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-28 00:11:18,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-28 00:11:18,867 INFO L175 Difference]: Start difference. First operand has 227 places, 512 transitions, 9831 flow. Second operand 9 states and 162 transitions. [2024-06-28 00:11:18,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 568 transitions, 11939 flow [2024-06-28 00:11:19,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 568 transitions, 11280 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-28 00:11:19,430 INFO L231 Difference]: Finished difference. Result has 230 places, 534 transitions, 10316 flow [2024-06-28 00:11:19,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9214, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10316, PETRI_PLACES=230, PETRI_TRANSITIONS=534} [2024-06-28 00:11:19,432 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 189 predicate places. [2024-06-28 00:11:19,432 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 534 transitions, 10316 flow [2024-06-28 00:11:19,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:19,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:19,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:19,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 00:11:19,436 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:19,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1331840329, now seen corresponding path program 3 times [2024-06-28 00:11:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:19,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511309489] [2024-06-28 00:11:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:21,212 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:11:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511309489] [2024-06-28 00:11:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511309489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:21,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:21,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:11:21,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317440730] [2024-06-28 00:11:21,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:21,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:11:21,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:21,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:11:21,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:11:21,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:11:21,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 534 transitions, 10316 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:11:21,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:21,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:11:21,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:22,852 INFO L124 PetriNetUnfolderBase]: 3639/5494 cut-off events. [2024-06-28 00:11:22,852 INFO L125 PetriNetUnfolderBase]: For 271914/271920 co-relation queries the response was YES. [2024-06-28 00:11:22,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48311 conditions, 5494 events. 3639/5494 cut-off events. For 271914/271920 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 29434 event pairs, 1024 based on Foata normal form. 8/5502 useless extension candidates. Maximal degree in co-relation 48204. Up to 4865 conditions per place. [2024-06-28 00:11:22,907 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 414 selfloop transitions, 160 changer transitions 0/577 dead transitions. [2024-06-28 00:11:22,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 577 transitions, 12051 flow [2024-06-28 00:11:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 00:11:22,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-28 00:11:22,909 INFO L175 Difference]: Start difference. First operand has 230 places, 534 transitions, 10316 flow. Second operand 8 states and 148 transitions. [2024-06-28 00:11:22,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 577 transitions, 12051 flow [2024-06-28 00:11:23,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 577 transitions, 11248 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-28 00:11:23,373 INFO L231 Difference]: Finished difference. Result has 230 places, 540 transitions, 10011 flow [2024-06-28 00:11:23,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9517, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10011, PETRI_PLACES=230, PETRI_TRANSITIONS=540} [2024-06-28 00:11:23,374 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 189 predicate places. [2024-06-28 00:11:23,374 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 540 transitions, 10011 flow [2024-06-28 00:11:23,374 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:11:23,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:23,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:23,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 00:11:23,375 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:23,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash 389849095, now seen corresponding path program 3 times [2024-06-28 00:11:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:23,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220906896] [2024-06-28 00:11:23,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:25,597 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:11:25,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:25,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220906896] [2024-06-28 00:11:25,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220906896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:25,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:25,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:25,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558062959] [2024-06-28 00:11:25,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:25,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:25,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:25,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:25,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:11:25,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 540 transitions, 10011 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:25,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:25,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:11:25,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:27,347 INFO L124 PetriNetUnfolderBase]: 3678/5539 cut-off events. [2024-06-28 00:11:27,347 INFO L125 PetriNetUnfolderBase]: For 268029/268035 co-relation queries the response was YES. [2024-06-28 00:11:27,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48367 conditions, 5539 events. 3678/5539 cut-off events. For 268029/268035 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 29646 event pairs, 1040 based on Foata normal form. 6/5545 useless extension candidates. Maximal degree in co-relation 48260. Up to 5145 conditions per place. [2024-06-28 00:11:27,406 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 460 selfloop transitions, 130 changer transitions 0/593 dead transitions. [2024-06-28 00:11:27,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 593 transitions, 11855 flow [2024-06-28 00:11:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:11:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:11:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2024-06-28 00:11:27,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159090909090909 [2024-06-28 00:11:27,408 INFO L175 Difference]: Start difference. First operand has 230 places, 540 transitions, 10011 flow. Second operand 11 states and 183 transitions. [2024-06-28 00:11:27,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 593 transitions, 11855 flow [2024-06-28 00:11:27,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 593 transitions, 11586 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:27,936 INFO L231 Difference]: Finished difference. Result has 237 places, 555 transitions, 10392 flow [2024-06-28 00:11:27,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9758, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10392, PETRI_PLACES=237, PETRI_TRANSITIONS=555} [2024-06-28 00:11:27,937 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 196 predicate places. [2024-06-28 00:11:27,937 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 555 transitions, 10392 flow [2024-06-28 00:11:27,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:27,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:27,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:27,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 00:11:27,938 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:27,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash 389855853, now seen corresponding path program 2 times [2024-06-28 00:11:27,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:27,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701686248] [2024-06-28 00:11:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:27,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:29,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:11:29,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701686248] [2024-06-28 00:11:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701686248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:29,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:29,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:29,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531586803] [2024-06-28 00:11:29,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:29,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:29,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:29,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:30,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:11:30,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 555 transitions, 10392 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:30,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:30,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:11:30,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:31,735 INFO L124 PetriNetUnfolderBase]: 3706/5582 cut-off events. [2024-06-28 00:11:31,735 INFO L125 PetriNetUnfolderBase]: For 280177/280183 co-relation queries the response was YES. [2024-06-28 00:11:31,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48886 conditions, 5582 events. 3706/5582 cut-off events. For 280177/280183 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 29905 event pairs, 1024 based on Foata normal form. 6/5588 useless extension candidates. Maximal degree in co-relation 48777. Up to 5266 conditions per place. [2024-06-28 00:11:31,799 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 496 selfloop transitions, 89 changer transitions 0/588 dead transitions. [2024-06-28 00:11:31,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 588 transitions, 11720 flow [2024-06-28 00:11:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:11:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:11:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-28 00:11:31,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-28 00:11:31,801 INFO L175 Difference]: Start difference. First operand has 237 places, 555 transitions, 10392 flow. Second operand 9 states and 151 transitions. [2024-06-28 00:11:31,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 588 transitions, 11720 flow [2024-06-28 00:11:32,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 588 transitions, 11321 flow, removed 38 selfloop flow, removed 10 redundant places. [2024-06-28 00:11:32,331 INFO L231 Difference]: Finished difference. Result has 236 places, 559 transitions, 10241 flow [2024-06-28 00:11:32,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9993, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10241, PETRI_PLACES=236, PETRI_TRANSITIONS=559} [2024-06-28 00:11:32,331 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 195 predicate places. [2024-06-28 00:11:32,331 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 559 transitions, 10241 flow [2024-06-28 00:11:32,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:32,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:32,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:32,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 00:11:32,332 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:32,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 389676115, now seen corresponding path program 4 times [2024-06-28 00:11:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837197253] [2024-06-28 00:11:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:34,761 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:11:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837197253] [2024-06-28 00:11:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837197253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:34,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:34,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884553244] [2024-06-28 00:11:34,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:34,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:34,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:11:34,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 559 transitions, 10241 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:34,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:34,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:11:34,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:36,572 INFO L124 PetriNetUnfolderBase]: 3692/5563 cut-off events. [2024-06-28 00:11:36,572 INFO L125 PetriNetUnfolderBase]: For 274381/274387 co-relation queries the response was YES. [2024-06-28 00:11:36,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48307 conditions, 5563 events. 3692/5563 cut-off events. For 274381/274387 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 29813 event pairs, 1024 based on Foata normal form. 6/5569 useless extension candidates. Maximal degree in co-relation 48198. Up to 5173 conditions per place. [2024-06-28 00:11:36,627 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 457 selfloop transitions, 128 changer transitions 0/588 dead transitions. [2024-06-28 00:11:36,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 588 transitions, 11560 flow [2024-06-28 00:11:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:11:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:11:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 00:11:36,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-28 00:11:36,628 INFO L175 Difference]: Start difference. First operand has 236 places, 559 transitions, 10241 flow. Second operand 9 states and 155 transitions. [2024-06-28 00:11:36,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 588 transitions, 11560 flow [2024-06-28 00:11:37,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 588 transitions, 11360 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-28 00:11:37,164 INFO L231 Difference]: Finished difference. Result has 239 places, 559 transitions, 10322 flow [2024-06-28 00:11:37,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10041, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10322, PETRI_PLACES=239, PETRI_TRANSITIONS=559} [2024-06-28 00:11:37,165 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places. [2024-06-28 00:11:37,165 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 559 transitions, 10322 flow [2024-06-28 00:11:37,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:37,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:37,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:37,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 00:11:37,166 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:37,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash 389671279, now seen corresponding path program 4 times [2024-06-28 00:11:37,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:37,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645183521] [2024-06-28 00:11:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:39,096 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:11:39,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:39,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645183521] [2024-06-28 00:11:39,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645183521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:39,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:39,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:39,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203561816] [2024-06-28 00:11:39,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:39,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:39,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:39,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:39,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:39,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:11:39,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 559 transitions, 10322 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:39,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:39,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:11:39,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:40,730 INFO L124 PetriNetUnfolderBase]: 3728/5627 cut-off events. [2024-06-28 00:11:40,730 INFO L125 PetriNetUnfolderBase]: For 288832/288838 co-relation queries the response was YES. [2024-06-28 00:11:40,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49002 conditions, 5627 events. 3728/5627 cut-off events. For 288832/288838 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 30308 event pairs, 1018 based on Foata normal form. 8/5635 useless extension candidates. Maximal degree in co-relation 48892. Up to 4948 conditions per place. [2024-06-28 00:11:40,806 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 422 selfloop transitions, 181 changer transitions 0/606 dead transitions. [2024-06-28 00:11:40,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 606 transitions, 11986 flow [2024-06-28 00:11:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:11:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:11:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-28 00:11:40,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-28 00:11:40,808 INFO L175 Difference]: Start difference. First operand has 239 places, 559 transitions, 10322 flow. Second operand 9 states and 162 transitions. [2024-06-28 00:11:40,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 606 transitions, 11986 flow [2024-06-28 00:11:41,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 606 transitions, 11746 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 00:11:41,388 INFO L231 Difference]: Finished difference. Result has 240 places, 565 transitions, 10558 flow [2024-06-28 00:11:41,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10085, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10558, PETRI_PLACES=240, PETRI_TRANSITIONS=565} [2024-06-28 00:11:41,389 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places. [2024-06-28 00:11:41,389 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 565 transitions, 10558 flow [2024-06-28 00:11:41,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:41,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:41,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:41,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 00:11:41,389 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:41,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash 389671155, now seen corresponding path program 5 times [2024-06-28 00:11:41,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:41,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484921055] [2024-06-28 00:11:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:43,333 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:11:43,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:43,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484921055] [2024-06-28 00:11:43,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484921055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:43,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:43,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:43,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522619583] [2024-06-28 00:11:43,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:43,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:43,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:11:43,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 565 transitions, 10558 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:43,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:43,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:11:43,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:45,091 INFO L124 PetriNetUnfolderBase]: 3948/5977 cut-off events. [2024-06-28 00:11:45,092 INFO L125 PetriNetUnfolderBase]: For 320385/320391 co-relation queries the response was YES. [2024-06-28 00:11:45,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51621 conditions, 5977 events. 3948/5977 cut-off events. For 320385/320391 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 32766 event pairs, 1034 based on Foata normal form. 38/6015 useless extension candidates. Maximal degree in co-relation 51511. Up to 5208 conditions per place. [2024-06-28 00:11:45,170 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 479 selfloop transitions, 155 changer transitions 0/637 dead transitions. [2024-06-28 00:11:45,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 637 transitions, 12732 flow [2024-06-28 00:11:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:11:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:11:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 00:11:45,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-28 00:11:45,172 INFO L175 Difference]: Start difference. First operand has 240 places, 565 transitions, 10558 flow. Second operand 9 states and 165 transitions. [2024-06-28 00:11:45,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 637 transitions, 12732 flow [2024-06-28 00:11:45,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 637 transitions, 12285 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-28 00:11:45,717 INFO L231 Difference]: Finished difference. Result has 244 places, 594 transitions, 11149 flow [2024-06-28 00:11:45,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10159, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11149, PETRI_PLACES=244, PETRI_TRANSITIONS=594} [2024-06-28 00:11:45,717 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 203 predicate places. [2024-06-28 00:11:45,717 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 594 transitions, 11149 flow [2024-06-28 00:11:45,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:11:45,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:45,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:45,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 00:11:45,718 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:45,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash 63121551, now seen corresponding path program 3 times [2024-06-28 00:11:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904989768] [2024-06-28 00:11:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:47,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:11:47,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:47,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904989768] [2024-06-28 00:11:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904989768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:47,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405716193] [2024-06-28 00:11:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:47,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:47,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:47,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:11:47,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 594 transitions, 11149 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:47,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:47,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:11:47,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:48,593 INFO L124 PetriNetUnfolderBase]: 3965/5991 cut-off events. [2024-06-28 00:11:48,593 INFO L125 PetriNetUnfolderBase]: For 307407/307411 co-relation queries the response was YES. [2024-06-28 00:11:48,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52380 conditions, 5991 events. 3965/5991 cut-off events. For 307407/307411 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32741 event pairs, 1279 based on Foata normal form. 8/5999 useless extension candidates. Maximal degree in co-relation 52267. Up to 5836 conditions per place. [2024-06-28 00:11:48,672 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 595 selfloop transitions, 18 changer transitions 0/616 dead transitions. [2024-06-28 00:11:48,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 616 transitions, 12491 flow [2024-06-28 00:11:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-28 00:11:48,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-28 00:11:48,673 INFO L175 Difference]: Start difference. First operand has 244 places, 594 transitions, 11149 flow. Second operand 8 states and 119 transitions. [2024-06-28 00:11:48,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 616 transitions, 12491 flow [2024-06-28 00:11:49,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 616 transitions, 12242 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:49,423 INFO L231 Difference]: Finished difference. Result has 247 places, 596 transitions, 10989 flow [2024-06-28 00:11:49,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10900, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10989, PETRI_PLACES=247, PETRI_TRANSITIONS=596} [2024-06-28 00:11:49,423 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 206 predicate places. [2024-06-28 00:11:49,424 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 596 transitions, 10989 flow [2024-06-28 00:11:49,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:49,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:49,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:49,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 00:11:49,424 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:49,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash -173350479, now seen corresponding path program 4 times [2024-06-28 00:11:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:49,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443289467] [2024-06-28 00:11:49,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:49,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:51,050 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:11:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:51,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443289467] [2024-06-28 00:11:51,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443289467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:51,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:51,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:51,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333539194] [2024-06-28 00:11:51,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:51,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:51,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:51,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:11:51,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 596 transitions, 10989 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:51,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:51,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:11:51,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:52,787 INFO L124 PetriNetUnfolderBase]: 3982/6031 cut-off events. [2024-06-28 00:11:52,787 INFO L125 PetriNetUnfolderBase]: For 319628/319632 co-relation queries the response was YES. [2024-06-28 00:11:52,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52232 conditions, 6031 events. 3982/6031 cut-off events. For 319628/319632 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33204 event pairs, 1267 based on Foata normal form. 4/6035 useless extension candidates. Maximal degree in co-relation 52118. Up to 5710 conditions per place. [2024-06-28 00:11:52,860 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 539 selfloop transitions, 79 changer transitions 0/621 dead transitions. [2024-06-28 00:11:52,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 621 transitions, 12393 flow [2024-06-28 00:11:52,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-28 00:11:52,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-28 00:11:52,863 INFO L175 Difference]: Start difference. First operand has 247 places, 596 transitions, 10989 flow. Second operand 8 states and 125 transitions. [2024-06-28 00:11:52,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 621 transitions, 12393 flow [2024-06-28 00:11:53,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 621 transitions, 12314 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:53,538 INFO L231 Difference]: Finished difference. Result has 250 places, 598 transitions, 11133 flow [2024-06-28 00:11:53,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10910, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11133, PETRI_PLACES=250, PETRI_TRANSITIONS=598} [2024-06-28 00:11:53,538 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places. [2024-06-28 00:11:53,538 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 598 transitions, 11133 flow [2024-06-28 00:11:53,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:53,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:53,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:53,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 00:11:53,539 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:53,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash -173535053, now seen corresponding path program 5 times [2024-06-28 00:11:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598408927] [2024-06-28 00:11:53,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:55,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:11:55,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598408927] [2024-06-28 00:11:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598408927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:55,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:55,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:55,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921911835] [2024-06-28 00:11:55,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:55,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:55,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:55,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:55,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:11:55,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 598 transitions, 11133 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:55,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:55,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:11:55,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:57,358 INFO L124 PetriNetUnfolderBase]: 3966/6014 cut-off events. [2024-06-28 00:11:57,358 INFO L125 PetriNetUnfolderBase]: For 326225/326229 co-relation queries the response was YES. [2024-06-28 00:11:57,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52216 conditions, 6014 events. 3966/6014 cut-off events. For 326225/326229 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 33187 event pairs, 1260 based on Foata normal form. 6/6020 useless extension candidates. Maximal degree in co-relation 52101. Up to 5585 conditions per place. [2024-06-28 00:11:57,423 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 525 selfloop transitions, 103 changer transitions 0/631 dead transitions. [2024-06-28 00:11:57,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 631 transitions, 12816 flow [2024-06-28 00:11:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 00:11:57,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44375 [2024-06-28 00:11:57,429 INFO L175 Difference]: Start difference. First operand has 250 places, 598 transitions, 11133 flow. Second operand 8 states and 142 transitions. [2024-06-28 00:11:57,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 631 transitions, 12816 flow [2024-06-28 00:11:58,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 631 transitions, 12680 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:58,166 INFO L231 Difference]: Finished difference. Result has 253 places, 598 transitions, 11214 flow [2024-06-28 00:11:58,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10997, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11214, PETRI_PLACES=253, PETRI_TRANSITIONS=598} [2024-06-28 00:11:58,167 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 212 predicate places. [2024-06-28 00:11:58,167 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 598 transitions, 11214 flow [2024-06-28 00:11:58,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:58,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:58,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:58,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 00:11:58,167 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:58,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash -173535177, now seen corresponding path program 6 times [2024-06-28 00:11:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:58,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246880873] [2024-06-28 00:11:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:58,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:59,916 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:11:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:59,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246880873] [2024-06-28 00:11:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246880873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:59,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:59,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:59,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942505385] [2024-06-28 00:11:59,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:59,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:59,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:11:59,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 598 transitions, 11214 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:11:59,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:59,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:11:59,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:01,719 INFO L124 PetriNetUnfolderBase]: 4069/6193 cut-off events. [2024-06-28 00:12:01,720 INFO L125 PetriNetUnfolderBase]: For 358225/358229 co-relation queries the response was YES. [2024-06-28 00:12:01,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52798 conditions, 6193 events. 4069/6193 cut-off events. For 358225/358229 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 34551 event pairs, 1279 based on Foata normal form. 39/6232 useless extension candidates. Maximal degree in co-relation 52682. Up to 5356 conditions per place. [2024-06-28 00:12:01,798 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 488 selfloop transitions, 153 changer transitions 0/644 dead transitions. [2024-06-28 00:12:01,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 644 transitions, 13067 flow [2024-06-28 00:12:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 00:12:01,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-06-28 00:12:01,799 INFO L175 Difference]: Start difference. First operand has 253 places, 598 transitions, 11214 flow. Second operand 8 states and 149 transitions. [2024-06-28 00:12:01,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 644 transitions, 13067 flow [2024-06-28 00:12:02,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 644 transitions, 12631 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-28 00:12:02,386 INFO L231 Difference]: Finished difference. Result has 255 places, 604 transitions, 11254 flow [2024-06-28 00:12:02,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10778, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11254, PETRI_PLACES=255, PETRI_TRANSITIONS=604} [2024-06-28 00:12:02,387 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2024-06-28 00:12:02,387 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 604 transitions, 11254 flow [2024-06-28 00:12:02,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:12:02,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:02,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:02,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 00:12:02,388 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:02,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 62824633, now seen corresponding path program 5 times [2024-06-28 00:12:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378595817] [2024-06-28 00:12:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:03,874 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:12:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:03,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378595817] [2024-06-28 00:12:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378595817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104788594] [2024-06-28 00:12:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:03,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:03,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:03,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:03,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:12:03,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 604 transitions, 11254 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:12:03,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:03,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:12:03,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:05,552 INFO L124 PetriNetUnfolderBase]: 4043/6136 cut-off events. [2024-06-28 00:12:05,553 INFO L125 PetriNetUnfolderBase]: For 341900/341904 co-relation queries the response was YES. [2024-06-28 00:12:05,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52599 conditions, 6136 events. 4043/6136 cut-off events. For 341900/341904 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 33951 event pairs, 1320 based on Foata normal form. 8/6144 useless extension candidates. Maximal degree in co-relation 52481. Up to 5923 conditions per place. [2024-06-28 00:12:05,620 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 569 selfloop transitions, 57 changer transitions 0/629 dead transitions. [2024-06-28 00:12:05,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 629 transitions, 12694 flow [2024-06-28 00:12:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-28 00:12:05,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2024-06-28 00:12:05,622 INFO L175 Difference]: Start difference. First operand has 255 places, 604 transitions, 11254 flow. Second operand 7 states and 114 transitions. [2024-06-28 00:12:05,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 629 transitions, 12694 flow [2024-06-28 00:12:06,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 629 transitions, 12172 flow, removed 66 selfloop flow, removed 6 redundant places. [2024-06-28 00:12:06,422 INFO L231 Difference]: Finished difference. Result has 256 places, 604 transitions, 10887 flow [2024-06-28 00:12:06,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10736, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10887, PETRI_PLACES=256, PETRI_TRANSITIONS=604} [2024-06-28 00:12:06,423 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 215 predicate places. [2024-06-28 00:12:06,423 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 604 transitions, 10887 flow [2024-06-28 00:12:06,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:12:06,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:06,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:06,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 00:12:06,423 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:06,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash 62824881, now seen corresponding path program 5 times [2024-06-28 00:12:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621005298] [2024-06-28 00:12:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:07,830 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:12:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621005298] [2024-06-28 00:12:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621005298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:07,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920345666] [2024-06-28 00:12:07,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:07,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:07,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:07,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:12:07,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 604 transitions, 10887 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:12:07,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:07,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:12:07,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:09,465 INFO L124 PetriNetUnfolderBase]: 4035/6127 cut-off events. [2024-06-28 00:12:09,465 INFO L125 PetriNetUnfolderBase]: For 345309/345313 co-relation queries the response was YES. [2024-06-28 00:12:09,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51597 conditions, 6127 events. 4035/6127 cut-off events. For 345309/345313 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 33925 event pairs, 1318 based on Foata normal form. 8/6135 useless extension candidates. Maximal degree in co-relation 51478. Up to 5943 conditions per place. [2024-06-28 00:12:09,543 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 591 selfloop transitions, 32 changer transitions 0/626 dead transitions. [2024-06-28 00:12:09,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 626 transitions, 12251 flow [2024-06-28 00:12:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-28 00:12:09,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2024-06-28 00:12:09,544 INFO L175 Difference]: Start difference. First operand has 256 places, 604 transitions, 10887 flow. Second operand 7 states and 113 transitions. [2024-06-28 00:12:09,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 626 transitions, 12251 flow [2024-06-28 00:12:10,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 626 transitions, 12128 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-28 00:12:10,230 INFO L231 Difference]: Finished difference. Result has 258 places, 604 transitions, 10838 flow [2024-06-28 00:12:10,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10764, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10838, PETRI_PLACES=258, PETRI_TRANSITIONS=604} [2024-06-28 00:12:10,231 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 217 predicate places. [2024-06-28 00:12:10,231 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 604 transitions, 10838 flow [2024-06-28 00:12:10,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:12:10,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:10,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:10,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 00:12:10,231 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:12:10,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:10,232 INFO L85 PathProgramCache]: Analyzing trace with hash -117281217, now seen corresponding path program 1 times [2024-06-28 00:12:10,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:10,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772624039] [2024-06-28 00:12:10,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:10,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:11,490 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:12:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:11,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772624039] [2024-06-28 00:12:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772624039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:11,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:11,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:12:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183054383] [2024-06-28 00:12:11,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:11,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:12:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:11,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:12:11,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:12:11,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:12:11,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 604 transitions, 10838 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:12:11,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:11,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:12:11,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:13,047 INFO L124 PetriNetUnfolderBase]: 3905/5956 cut-off events. [2024-06-28 00:12:13,047 INFO L125 PetriNetUnfolderBase]: For 360560/360744 co-relation queries the response was YES. [2024-06-28 00:12:13,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50398 conditions, 5956 events. 3905/5956 cut-off events. For 360560/360744 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 33368 event pairs, 1221 based on Foata normal form. 106/6002 useless extension candidates. Maximal degree in co-relation 50278. Up to 5729 conditions per place. [2024-06-28 00:12:13,114 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 568 selfloop transitions, 23 changer transitions 0/618 dead transitions. [2024-06-28 00:12:13,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 618 transitions, 12100 flow [2024-06-28 00:12:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2024-06-28 00:12:13,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2024-06-28 00:12:13,115 INFO L175 Difference]: Start difference. First operand has 258 places, 604 transitions, 10838 flow. Second operand 7 states and 106 transitions. [2024-06-28 00:12:13,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 618 transitions, 12100 flow [2024-06-28 00:12:13,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 618 transitions, 11919 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-28 00:12:13,735 INFO L231 Difference]: Finished difference. Result has 259 places, 607 transitions, 10764 flow [2024-06-28 00:12:13,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10657, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10764, PETRI_PLACES=259, PETRI_TRANSITIONS=607} [2024-06-28 00:12:13,735 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 218 predicate places. [2024-06-28 00:12:13,736 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 607 transitions, 10764 flow [2024-06-28 00:12:13,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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:12:13,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:13,736 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:12:13,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 00:12:13,736 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:13,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1821156715, now seen corresponding path program 1 times [2024-06-28 00:12:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540904276] [2024-06-28 00:12:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:16,157 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:12:16,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:16,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540904276] [2024-06-28 00:12:16,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540904276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:16,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:16,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:16,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216768235] [2024-06-28 00:12:16,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:16,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:16,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:16,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:16,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:16,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:12:16,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 607 transitions, 10764 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:16,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:16,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:12:16,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:18,169 INFO L124 PetriNetUnfolderBase]: 4216/6435 cut-off events. [2024-06-28 00:12:18,170 INFO L125 PetriNetUnfolderBase]: For 384432/384442 co-relation queries the response was YES. [2024-06-28 00:12:18,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53627 conditions, 6435 events. 4216/6435 cut-off events. For 384432/384442 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 36253 event pairs, 799 based on Foata normal form. 30/6465 useless extension candidates. Maximal degree in co-relation 53506. Up to 3263 conditions per place. [2024-06-28 00:12:18,241 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 235 selfloop transitions, 429 changer transitions 0/667 dead transitions. [2024-06-28 00:12:18,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 667 transitions, 12668 flow [2024-06-28 00:12:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:12:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:12:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-28 00:12:18,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775 [2024-06-28 00:12:18,245 INFO L175 Difference]: Start difference. First operand has 259 places, 607 transitions, 10764 flow. Second operand 10 states and 191 transitions. [2024-06-28 00:12:18,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 667 transitions, 12668 flow [2024-06-28 00:12:18,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 667 transitions, 12545 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-28 00:12:18,988 INFO L231 Difference]: Finished difference. Result has 263 places, 612 transitions, 11601 flow [2024-06-28 00:12:18,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10641, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=426, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11601, PETRI_PLACES=263, PETRI_TRANSITIONS=612} [2024-06-28 00:12:18,989 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places. [2024-06-28 00:12:18,989 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 612 transitions, 11601 flow [2024-06-28 00:12:18,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:18,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:18,989 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:12:18,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 00:12:18,989 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:18,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:18,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1589875737, now seen corresponding path program 2 times [2024-06-28 00:12:18,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:18,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965919685] [2024-06-28 00:12:18,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:18,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:21,512 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:12:21,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965919685] [2024-06-28 00:12:21,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965919685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:21,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:21,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606300129] [2024-06-28 00:12:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:21,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:21,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:21,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:21,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:12:21,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 612 transitions, 11601 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:21,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:21,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:12:21,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:23,507 INFO L124 PetriNetUnfolderBase]: 4357/6679 cut-off events. [2024-06-28 00:12:23,507 INFO L125 PetriNetUnfolderBase]: For 416453/416463 co-relation queries the response was YES. [2024-06-28 00:12:23,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56630 conditions, 6679 events. 4357/6679 cut-off events. For 416453/416463 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 38420 event pairs, 1095 based on Foata normal form. 36/6715 useless extension candidates. Maximal degree in co-relation 56510. Up to 4947 conditions per place. [2024-06-28 00:12:23,584 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 255 selfloop transitions, 407 changer transitions 0/665 dead transitions. [2024-06-28 00:12:23,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 665 transitions, 13281 flow [2024-06-28 00:12:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:12:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:12:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-28 00:12:23,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-06-28 00:12:23,586 INFO L175 Difference]: Start difference. First operand has 263 places, 612 transitions, 11601 flow. Second operand 9 states and 178 transitions. [2024-06-28 00:12:23,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 665 transitions, 13281 flow [2024-06-28 00:12:24,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 665 transitions, 12634 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-28 00:12:24,391 INFO L231 Difference]: Finished difference. Result has 265 places, 615 transitions, 11842 flow [2024-06-28 00:12:24,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10960, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11842, PETRI_PLACES=265, PETRI_TRANSITIONS=615} [2024-06-28 00:12:24,392 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 224 predicate places. [2024-06-28 00:12:24,392 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 615 transitions, 11842 flow [2024-06-28 00:12:24,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:24,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:24,392 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:12:24,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 00:12:24,393 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:24,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1589872017, now seen corresponding path program 3 times [2024-06-28 00:12:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042457576] [2024-06-28 00:12:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:27,009 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:12:27,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:27,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042457576] [2024-06-28 00:12:27,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042457576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:27,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:27,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118752835] [2024-06-28 00:12:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:27,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:27,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:27,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:27,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:12:27,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 615 transitions, 11842 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:27,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:27,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:12:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:29,055 INFO L124 PetriNetUnfolderBase]: 4453/6834 cut-off events. [2024-06-28 00:12:29,055 INFO L125 PetriNetUnfolderBase]: For 422760/422770 co-relation queries the response was YES. [2024-06-28 00:12:29,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58196 conditions, 6834 events. 4453/6834 cut-off events. For 422760/422770 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 39591 event pairs, 1068 based on Foata normal form. 30/6864 useless extension candidates. Maximal degree in co-relation 58076. Up to 4884 conditions per place. [2024-06-28 00:12:29,133 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 256 selfloop transitions, 414 changer transitions 0/673 dead transitions. [2024-06-28 00:12:29,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 673 transitions, 13570 flow [2024-06-28 00:12:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:12:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:12:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 00:12:29,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-28 00:12:29,134 INFO L175 Difference]: Start difference. First operand has 265 places, 615 transitions, 11842 flow. Second operand 10 states and 190 transitions. [2024-06-28 00:12:29,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 673 transitions, 13570 flow [2024-06-28 00:12:29,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 673 transitions, 12750 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-28 00:12:29,975 INFO L231 Difference]: Finished difference. Result has 268 places, 617 transitions, 11906 flow [2024-06-28 00:12:29,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11022, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=412, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11906, PETRI_PLACES=268, PETRI_TRANSITIONS=617} [2024-06-28 00:12:29,976 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 227 predicate places. [2024-06-28 00:12:29,976 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 617 transitions, 11906 flow [2024-06-28 00:12:29,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:29,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:29,976 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:12:29,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 00:12:29,976 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:29,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash 896647385, now seen corresponding path program 4 times [2024-06-28 00:12:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933064850] [2024-06-28 00:12:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:32,246 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:12:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933064850] [2024-06-28 00:12:32,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933064850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:32,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:32,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144900988] [2024-06-28 00:12:32,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:32,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:32,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:32,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:32,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:32,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:12:32,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 617 transitions, 11906 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:32,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:32,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:12:32,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:34,418 INFO L124 PetriNetUnfolderBase]: 4577/7050 cut-off events. [2024-06-28 00:12:34,418 INFO L125 PetriNetUnfolderBase]: For 446772/446782 co-relation queries the response was YES. [2024-06-28 00:12:34,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59657 conditions, 7050 events. 4577/7050 cut-off events. For 446772/446782 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 41355 event pairs, 1330 based on Foata normal form. 36/7086 useless extension candidates. Maximal degree in co-relation 59535. Up to 5818 conditions per place. [2024-06-28 00:12:34,527 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 319 selfloop transitions, 347 changer transitions 0/669 dead transitions. [2024-06-28 00:12:34,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 669 transitions, 13671 flow [2024-06-28 00:12:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:12:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:12:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-28 00:12:34,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2024-06-28 00:12:34,529 INFO L175 Difference]: Start difference. First operand has 268 places, 617 transitions, 11906 flow. Second operand 10 states and 184 transitions. [2024-06-28 00:12:34,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 669 transitions, 13671 flow [2024-06-28 00:12:35,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 669 transitions, 12827 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-28 00:12:35,652 INFO L231 Difference]: Finished difference. Result has 270 places, 619 transitions, 11818 flow [2024-06-28 00:12:35,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11062, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=345, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11818, PETRI_PLACES=270, PETRI_TRANSITIONS=619} [2024-06-28 00:12:35,653 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places. [2024-06-28 00:12:35,653 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 619 transitions, 11818 flow [2024-06-28 00:12:35,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:35,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:35,653 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:12:35,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 00:12:35,654 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:35,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash -45193933, now seen corresponding path program 1 times [2024-06-28 00:12:35,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:35,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146635306] [2024-06-28 00:12:35,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:37,484 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:12:37,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:37,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146635306] [2024-06-28 00:12:37,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146635306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:37,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:37,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:37,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680646432] [2024-06-28 00:12:37,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:37,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:37,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:37,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:37,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:37,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:12:37,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 619 transitions, 11818 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:12:37,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:37,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:12:37,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:39,642 INFO L124 PetriNetUnfolderBase]: 4605/7078 cut-off events. [2024-06-28 00:12:39,642 INFO L125 PetriNetUnfolderBase]: For 427042/427052 co-relation queries the response was YES. [2024-06-28 00:12:39,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59854 conditions, 7078 events. 4605/7078 cut-off events. For 427042/427052 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 41458 event pairs, 1357 based on Foata normal form. 12/7090 useless extension candidates. Maximal degree in co-relation 59731. Up to 6169 conditions per place. [2024-06-28 00:12:39,729 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 314 selfloop transitions, 342 changer transitions 0/659 dead transitions. [2024-06-28 00:12:39,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 659 transitions, 13360 flow [2024-06-28 00:12:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:12:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:12:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-28 00:12:39,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275 [2024-06-28 00:12:39,731 INFO L175 Difference]: Start difference. First operand has 270 places, 619 transitions, 11818 flow. Second operand 10 states and 171 transitions. [2024-06-28 00:12:39,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 659 transitions, 13360 flow [2024-06-28 00:12:40,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 659 transitions, 12652 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-28 00:12:40,685 INFO L231 Difference]: Finished difference. Result has 272 places, 623 transitions, 11896 flow [2024-06-28 00:12:40,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11110, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11896, PETRI_PLACES=272, PETRI_TRANSITIONS=623} [2024-06-28 00:12:40,685 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 231 predicate places. [2024-06-28 00:12:40,686 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 623 transitions, 11896 flow [2024-06-28 00:12:40,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:12:40,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:40,686 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:12:40,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 00:12:40,686 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:40,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash -45347755, now seen corresponding path program 5 times [2024-06-28 00:12:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419314523] [2024-06-28 00:12:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:42,857 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:12:42,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:42,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419314523] [2024-06-28 00:12:42,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419314523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:42,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:42,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586683660] [2024-06-28 00:12:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:42,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:42,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:42,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:43,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:12:43,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 623 transitions, 11896 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:43,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:43,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:12:43,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:45,122 INFO L124 PetriNetUnfolderBase]: 4701/7251 cut-off events. [2024-06-28 00:12:45,123 INFO L125 PetriNetUnfolderBase]: For 467868/467878 co-relation queries the response was YES. [2024-06-28 00:12:45,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60980 conditions, 7251 events. 4701/7251 cut-off events. For 467868/467878 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 42866 event pairs, 1294 based on Foata normal form. 30/7281 useless extension candidates. Maximal degree in co-relation 60856. Up to 5662 conditions per place. [2024-06-28 00:12:45,202 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 324 selfloop transitions, 351 changer transitions 0/678 dead transitions. [2024-06-28 00:12:45,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 678 transitions, 13701 flow [2024-06-28 00:12:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:12:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:12:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-28 00:12:45,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465 [2024-06-28 00:12:45,204 INFO L175 Difference]: Start difference. First operand has 272 places, 623 transitions, 11896 flow. Second operand 10 states and 186 transitions. [2024-06-28 00:12:45,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 678 transitions, 13701 flow [2024-06-28 00:12:46,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 678 transitions, 12951 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-28 00:12:46,154 INFO L231 Difference]: Finished difference. Result has 274 places, 625 transitions, 11921 flow [2024-06-28 00:12:46,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11156, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11921, PETRI_PLACES=274, PETRI_TRANSITIONS=625} [2024-06-28 00:12:46,154 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 233 predicate places. [2024-06-28 00:12:46,154 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 625 transitions, 11921 flow [2024-06-28 00:12:46,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:46,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:46,155 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:12:46,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 00:12:46,155 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:46,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1755651721, now seen corresponding path program 2 times [2024-06-28 00:12:46,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:46,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295846602] [2024-06-28 00:12:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:48,119 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:12:48,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:48,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295846602] [2024-06-28 00:12:48,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295846602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:48,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:48,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177021559] [2024-06-28 00:12:48,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:48,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:48,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:48,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:48,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:48,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:12:48,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 625 transitions, 11921 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:12:48,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:48,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:12:48,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:50,362 INFO L124 PetriNetUnfolderBase]: 4740/7299 cut-off events. [2024-06-28 00:12:50,363 INFO L125 PetriNetUnfolderBase]: For 458230/458240 co-relation queries the response was YES. [2024-06-28 00:12:50,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61700 conditions, 7299 events. 4740/7299 cut-off events. For 458230/458240 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 43190 event pairs, 1322 based on Foata normal form. 12/7311 useless extension candidates. Maximal degree in co-relation 61575. Up to 6380 conditions per place. [2024-06-28 00:12:50,459 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 326 selfloop transitions, 336 changer transitions 0/665 dead transitions. [2024-06-28 00:12:50,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 665 transitions, 13509 flow [2024-06-28 00:12:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:12:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:12:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-28 00:12:50,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275 [2024-06-28 00:12:50,460 INFO L175 Difference]: Start difference. First operand has 274 places, 625 transitions, 11921 flow. Second operand 10 states and 171 transitions. [2024-06-28 00:12:50,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 665 transitions, 13509 flow [2024-06-28 00:12:51,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 665 transitions, 12786 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-28 00:12:51,687 INFO L231 Difference]: Finished difference. Result has 276 places, 631 transitions, 11999 flow [2024-06-28 00:12:51,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11198, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=330, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11999, PETRI_PLACES=276, PETRI_TRANSITIONS=631} [2024-06-28 00:12:51,688 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2024-06-28 00:12:51,688 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 631 transitions, 11999 flow [2024-06-28 00:12:51,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:12:51,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:51,688 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:12:51,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 00:12:51,688 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:51,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1668127949, now seen corresponding path program 6 times [2024-06-28 00:12:51,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:51,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105783226] [2024-06-28 00:12:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:53,888 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:12:53,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105783226] [2024-06-28 00:12:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105783226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:53,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600680219] [2024-06-28 00:12:53,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:53,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:53,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:53,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:53,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:12:53,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 631 transitions, 11999 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:53,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:53,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:12:53,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:56,081 INFO L124 PetriNetUnfolderBase]: 4864/7532 cut-off events. [2024-06-28 00:12:56,081 INFO L125 PetriNetUnfolderBase]: For 511438/511444 co-relation queries the response was YES. [2024-06-28 00:12:56,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63027 conditions, 7532 events. 4864/7532 cut-off events. For 511438/511444 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 45158 event pairs, 1575 based on Foata normal form. 32/7564 useless extension candidates. Maximal degree in co-relation 62901. Up to 6594 conditions per place. [2024-06-28 00:12:56,179 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 473 selfloop transitions, 206 changer transitions 0/682 dead transitions. [2024-06-28 00:12:56,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 682 transitions, 13834 flow [2024-06-28 00:12:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:12:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:12:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 00:12:56,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-28 00:12:56,180 INFO L175 Difference]: Start difference. First operand has 276 places, 631 transitions, 11999 flow. Second operand 9 states and 172 transitions. [2024-06-28 00:12:56,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 682 transitions, 13834 flow [2024-06-28 00:12:57,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 682 transitions, 13097 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-28 00:12:57,279 INFO L231 Difference]: Finished difference. Result has 277 places, 633 transitions, 11756 flow [2024-06-28 00:12:57,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11274, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11756, PETRI_PLACES=277, PETRI_TRANSITIONS=633} [2024-06-28 00:12:57,279 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 236 predicate places. [2024-06-28 00:12:57,280 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 633 transitions, 11756 flow [2024-06-28 00:12:57,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:12:57,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:57,280 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:12:57,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 00:12:57,280 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:57,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash 462516383, now seen corresponding path program 3 times [2024-06-28 00:12:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:57,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439126157] [2024-06-28 00:12:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:59,271 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:12:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439126157] [2024-06-28 00:12:59,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439126157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:59,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:59,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:59,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742714600] [2024-06-28 00:12:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:59,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:59,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:59,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:59,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:59,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:12:59,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 633 transitions, 11756 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:12:59,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:59,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:12:59,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:01,497 INFO L124 PetriNetUnfolderBase]: 4892/7555 cut-off events. [2024-06-28 00:13:01,498 INFO L125 PetriNetUnfolderBase]: For 487208/487214 co-relation queries the response was YES. [2024-06-28 00:13:01,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63238 conditions, 7555 events. 4892/7555 cut-off events. For 487208/487214 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 45186 event pairs, 1600 based on Foata normal form. 8/7563 useless extension candidates. Maximal degree in co-relation 63112. Up to 7105 conditions per place. [2024-06-28 00:13:01,594 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 527 selfloop transitions, 141 changer transitions 0/671 dead transitions. [2024-06-28 00:13:01,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 671 transitions, 13359 flow [2024-06-28 00:13:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:13:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:13:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-28 00:13:01,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4225 [2024-06-28 00:13:01,596 INFO L175 Difference]: Start difference. First operand has 277 places, 633 transitions, 11756 flow. Second operand 10 states and 169 transitions. [2024-06-28 00:13:01,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 671 transitions, 13359 flow [2024-06-28 00:13:02,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 671 transitions, 12925 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 00:13:02,816 INFO L231 Difference]: Finished difference. Result has 280 places, 637 transitions, 11722 flow [2024-06-28 00:13:02,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11322, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11722, PETRI_PLACES=280, PETRI_TRANSITIONS=637} [2024-06-28 00:13:02,816 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 239 predicate places. [2024-06-28 00:13:02,817 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 637 transitions, 11722 flow [2024-06-28 00:13:02,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:02,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:02,817 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:13:02,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 00:13:02,817 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:02,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:02,818 INFO L85 PathProgramCache]: Analyzing trace with hash 462362561, now seen corresponding path program 7 times [2024-06-28 00:13:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:02,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868740898] [2024-06-28 00:13:02,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:05,242 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:13:05,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868740898] [2024-06-28 00:13:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868740898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:05,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:05,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177077922] [2024-06-28 00:13:05,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:05,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:05,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:05,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:05,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:13:05,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 637 transitions, 11722 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:13:05,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:05,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:13:05,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:07,709 INFO L124 PetriNetUnfolderBase]: 4988/7725 cut-off events. [2024-06-28 00:13:07,709 INFO L125 PetriNetUnfolderBase]: For 532879/532885 co-relation queries the response was YES. [2024-06-28 00:13:07,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64165 conditions, 7725 events. 4988/7725 cut-off events. For 532879/532885 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 46596 event pairs, 1516 based on Foata normal form. 26/7751 useless extension candidates. Maximal degree in co-relation 64037. Up to 6240 conditions per place. [2024-06-28 00:13:07,816 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 477 selfloop transitions, 213 changer transitions 0/693 dead transitions. [2024-06-28 00:13:07,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 693 transitions, 13819 flow [2024-06-28 00:13:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:13:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:13:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-28 00:13:07,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2024-06-28 00:13:07,818 INFO L175 Difference]: Start difference. First operand has 280 places, 637 transitions, 11722 flow. Second operand 10 states and 184 transitions. [2024-06-28 00:13:07,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 693 transitions, 13819 flow [2024-06-28 00:13:08,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 693 transitions, 13459 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-28 00:13:08,993 INFO L231 Difference]: Finished difference. Result has 282 places, 639 transitions, 11865 flow [2024-06-28 00:13:08,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11368, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11865, PETRI_PLACES=282, PETRI_TRANSITIONS=639} [2024-06-28 00:13:08,994 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 241 predicate places. [2024-06-28 00:13:08,994 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 639 transitions, 11865 flow [2024-06-28 00:13:08,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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:13:08,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:08,994 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:13:08,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 00:13:08,994 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:08,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:08,995 INFO L85 PathProgramCache]: Analyzing trace with hash -799578415, now seen corresponding path program 4 times [2024-06-28 00:13:08,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:08,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986836163] [2024-06-28 00:13:08,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:08,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:10,961 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:13:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986836163] [2024-06-28 00:13:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986836163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:10,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:10,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:10,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029506027] [2024-06-28 00:13:10,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:10,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:10,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:10,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:10,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:11,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:13:11,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 639 transitions, 11865 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:11,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:11,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:13:11,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:13,478 INFO L124 PetriNetUnfolderBase]: 5016/7761 cut-off events. [2024-06-28 00:13:13,478 INFO L125 PetriNetUnfolderBase]: For 520848/520854 co-relation queries the response was YES. [2024-06-28 00:13:13,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65061 conditions, 7761 events. 5016/7761 cut-off events. For 520848/520854 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 46840 event pairs, 1650 based on Foata normal form. 8/7769 useless extension candidates. Maximal degree in co-relation 64932. Up to 7298 conditions per place. [2024-06-28 00:13:13,570 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 538 selfloop transitions, 143 changer transitions 0/684 dead transitions. [2024-06-28 00:13:13,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 684 transitions, 13526 flow [2024-06-28 00:13:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:13:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:13:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 195 transitions. [2024-06-28 00:13:13,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-28 00:13:13,572 INFO L175 Difference]: Start difference. First operand has 282 places, 639 transitions, 11865 flow. Second operand 12 states and 195 transitions. [2024-06-28 00:13:13,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 684 transitions, 13526 flow [2024-06-28 00:13:14,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 684 transitions, 13092 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-28 00:13:14,718 INFO L231 Difference]: Finished difference. Result has 287 places, 643 transitions, 11846 flow [2024-06-28 00:13:14,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11431, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11846, PETRI_PLACES=287, PETRI_TRANSITIONS=643} [2024-06-28 00:13:14,718 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 246 predicate places. [2024-06-28 00:13:14,718 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 643 transitions, 11846 flow [2024-06-28 00:13:14,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:14,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:14,719 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:13:14,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 00:13:14,719 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:14,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash -799369165, now seen corresponding path program 5 times [2024-06-28 00:13:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428183677] [2024-06-28 00:13:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:16,718 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:13:16,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:16,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428183677] [2024-06-28 00:13:16,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428183677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:16,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:16,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:16,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457082727] [2024-06-28 00:13:16,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:16,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:16,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:16,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:16,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:13:16,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 643 transitions, 11846 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:13:16,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:16,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:13:16,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:19,091 INFO L124 PetriNetUnfolderBase]: 5044/7805 cut-off events. [2024-06-28 00:13:19,091 INFO L125 PetriNetUnfolderBase]: For 535810/535816 co-relation queries the response was YES. [2024-06-28 00:13:19,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65359 conditions, 7805 events. 5044/7805 cut-off events. For 535810/535816 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 47197 event pairs, 1640 based on Foata normal form. 8/7813 useless extension candidates. Maximal degree in co-relation 65229. Up to 7244 conditions per place. [2024-06-28 00:13:19,191 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 532 selfloop transitions, 155 changer transitions 0/690 dead transitions. [2024-06-28 00:13:19,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 690 transitions, 13526 flow [2024-06-28 00:13:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:13:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:13:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 195 transitions. [2024-06-28 00:13:19,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-28 00:13:19,193 INFO L175 Difference]: Start difference. First operand has 287 places, 643 transitions, 11846 flow. Second operand 12 states and 195 transitions. [2024-06-28 00:13:19,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 690 transitions, 13526 flow [2024-06-28 00:13:20,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 690 transitions, 13174 flow, removed 44 selfloop flow, removed 9 redundant places. [2024-06-28 00:13:20,427 INFO L231 Difference]: Finished difference. Result has 290 places, 647 transitions, 11936 flow [2024-06-28 00:13:20,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11494, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11936, PETRI_PLACES=290, PETRI_TRANSITIONS=647} [2024-06-28 00:13:20,428 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 249 predicate places. [2024-06-28 00:13:20,428 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 647 transitions, 11936 flow [2024-06-28 00:13:20,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:13:20,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:20,429 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:13:20,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 00:13:20,429 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:20,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:20,429 INFO L85 PathProgramCache]: Analyzing trace with hash 54642369, now seen corresponding path program 6 times [2024-06-28 00:13:20,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:20,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563111621] [2024-06-28 00:13:20,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:20,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:22,380 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:13:22,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:22,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563111621] [2024-06-28 00:13:22,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563111621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:22,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:22,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535203844] [2024-06-28 00:13:22,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:22,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:22,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:13:22,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 647 transitions, 11936 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:13:22,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:22,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:13:22,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:24,582 INFO L124 PetriNetUnfolderBase]: 5094/7891 cut-off events. [2024-06-28 00:13:24,582 INFO L125 PetriNetUnfolderBase]: For 555230/555234 co-relation queries the response was YES. [2024-06-28 00:13:24,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66224 conditions, 7891 events. 5094/7891 cut-off events. For 555230/555234 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 47788 event pairs, 1884 based on Foata normal form. 6/7897 useless extension candidates. Maximal degree in co-relation 66093. Up to 7169 conditions per place. [2024-06-28 00:13:24,685 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 430 selfloop transitions, 255 changer transitions 0/688 dead transitions. [2024-06-28 00:13:24,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 688 transitions, 13664 flow [2024-06-28 00:13:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:13:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:13:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-28 00:13:24,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925 [2024-06-28 00:13:24,686 INFO L175 Difference]: Start difference. First operand has 290 places, 647 transitions, 11936 flow. Second operand 10 states and 157 transitions. [2024-06-28 00:13:24,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 688 transitions, 13664 flow [2024-06-28 00:13:25,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 688 transitions, 13264 flow, removed 48 selfloop flow, removed 10 redundant places. [2024-06-28 00:13:25,903 INFO L231 Difference]: Finished difference. Result has 290 places, 655 transitions, 12233 flow [2024-06-28 00:13:25,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11536, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12233, PETRI_PLACES=290, PETRI_TRANSITIONS=655} [2024-06-28 00:13:25,904 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 249 predicate places. [2024-06-28 00:13:25,904 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 655 transitions, 12233 flow [2024-06-28 00:13:25,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:13:25,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:25,904 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:13:25,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 00:13:25,904 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:25,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash -52732387, now seen corresponding path program 7 times [2024-06-28 00:13:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:25,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542214754] [2024-06-28 00:13:25,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:27,968 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:13:27,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:27,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542214754] [2024-06-28 00:13:27,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542214754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:27,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:27,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063551325] [2024-06-28 00:13:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:27,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:27,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:27,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:28,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:13:28,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 655 transitions, 12233 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:28,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:28,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:13:28,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:30,496 INFO L124 PetriNetUnfolderBase]: 5133/7963 cut-off events. [2024-06-28 00:13:30,496 INFO L125 PetriNetUnfolderBase]: For 575205/575209 co-relation queries the response was YES. [2024-06-28 00:13:30,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67222 conditions, 7963 events. 5133/7963 cut-off events. For 575205/575209 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 48480 event pairs, 1916 based on Foata normal form. 6/7969 useless extension candidates. Maximal degree in co-relation 67090. Up to 7474 conditions per place. [2024-06-28 00:13:30,601 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 553 selfloop transitions, 149 changer transitions 0/705 dead transitions. [2024-06-28 00:13:30,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 705 transitions, 14108 flow [2024-06-28 00:13:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:13:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:13:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 183 transitions. [2024-06-28 00:13:30,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-28 00:13:30,602 INFO L175 Difference]: Start difference. First operand has 290 places, 655 transitions, 12233 flow. Second operand 12 states and 183 transitions. [2024-06-28 00:13:30,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 705 transitions, 14108 flow [2024-06-28 00:13:31,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 705 transitions, 13523 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-06-28 00:13:31,760 INFO L231 Difference]: Finished difference. Result has 294 places, 661 transitions, 12119 flow [2024-06-28 00:13:31,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11648, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12119, PETRI_PLACES=294, PETRI_TRANSITIONS=661} [2024-06-28 00:13:31,760 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 253 predicate places. [2024-06-28 00:13:31,760 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 661 transitions, 12119 flow [2024-06-28 00:13:31,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:31,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:31,761 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:13:31,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 00:13:31,761 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:31,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash -660727027, now seen corresponding path program 8 times [2024-06-28 00:13:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:31,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705136800] [2024-06-28 00:13:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:33,751 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:13:33,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:33,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705136800] [2024-06-28 00:13:33,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705136800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:33,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:33,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:33,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631174741] [2024-06-28 00:13:33,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:33,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:33,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:33,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:33,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:33,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:13:33,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 661 transitions, 12119 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:33,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:33,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:13:33,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:36,307 INFO L124 PetriNetUnfolderBase]: 5224/8106 cut-off events. [2024-06-28 00:13:36,307 INFO L125 PetriNetUnfolderBase]: For 606806/606810 co-relation queries the response was YES. [2024-06-28 00:13:36,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68793 conditions, 8106 events. 5224/8106 cut-off events. For 606806/606810 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 49517 event pairs, 1927 based on Foata normal form. 6/8112 useless extension candidates. Maximal degree in co-relation 68660. Up to 7488 conditions per place. [2024-06-28 00:13:36,416 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 549 selfloop transitions, 165 changer transitions 0/717 dead transitions. [2024-06-28 00:13:36,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 717 transitions, 14372 flow [2024-06-28 00:13:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:13:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:13:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-06-28 00:13:36,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-28 00:13:36,417 INFO L175 Difference]: Start difference. First operand has 294 places, 661 transitions, 12119 flow. Second operand 12 states and 185 transitions. [2024-06-28 00:13:36,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 717 transitions, 14372 flow [2024-06-28 00:13:37,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 717 transitions, 13996 flow, removed 52 selfloop flow, removed 9 redundant places. [2024-06-28 00:13:37,834 INFO L231 Difference]: Finished difference. Result has 298 places, 673 transitions, 12434 flow [2024-06-28 00:13:37,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11743, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12434, PETRI_PLACES=298, PETRI_TRANSITIONS=673} [2024-06-28 00:13:37,834 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places. [2024-06-28 00:13:37,835 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 673 transitions, 12434 flow [2024-06-28 00:13:37,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:37,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:37,835 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:13:37,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 00:13:37,835 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:37,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash -666298657, now seen corresponding path program 9 times [2024-06-28 00:13:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:37,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73140918] [2024-06-28 00:13:37,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:39,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:13:39,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:39,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73140918] [2024-06-28 00:13:39,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73140918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:39,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:39,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:39,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744051208] [2024-06-28 00:13:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:39,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:39,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:39,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:39,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:39,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:13:39,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 673 transitions, 12434 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:13:39,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:39,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:13:39,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:42,151 INFO L124 PetriNetUnfolderBase]: 5211/8090 cut-off events. [2024-06-28 00:13:42,151 INFO L125 PetriNetUnfolderBase]: For 612049/612053 co-relation queries the response was YES. [2024-06-28 00:13:42,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68614 conditions, 8090 events. 5211/8090 cut-off events. For 612049/612053 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 49454 event pairs, 1936 based on Foata normal form. 6/8096 useless extension candidates. Maximal degree in co-relation 68479. Up to 7610 conditions per place. [2024-06-28 00:13:42,249 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 562 selfloop transitions, 146 changer transitions 0/711 dead transitions. [2024-06-28 00:13:42,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 711 transitions, 14163 flow [2024-06-28 00:13:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:13:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:13:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-28 00:13:42,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925 [2024-06-28 00:13:42,250 INFO L175 Difference]: Start difference. First operand has 298 places, 673 transitions, 12434 flow. Second operand 10 states and 157 transitions. [2024-06-28 00:13:42,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 711 transitions, 14163 flow [2024-06-28 00:13:43,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 711 transitions, 13788 flow, removed 104 selfloop flow, removed 8 redundant places. [2024-06-28 00:13:43,476 INFO L231 Difference]: Finished difference. Result has 300 places, 673 transitions, 12366 flow [2024-06-28 00:13:43,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12059, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12366, PETRI_PLACES=300, PETRI_TRANSITIONS=673} [2024-06-28 00:13:43,476 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 259 predicate places. [2024-06-28 00:13:43,477 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 673 transitions, 12366 flow [2024-06-28 00:13:43,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:13:43,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:43,477 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:13:43,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 00:13:43,477 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:43,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:43,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1956769361, now seen corresponding path program 10 times [2024-06-28 00:13:43,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:43,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573688095] [2024-06-28 00:13:43,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:44,998 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:13:44,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573688095] [2024-06-28 00:13:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573688095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:44,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:44,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588951282] [2024-06-28 00:13:44,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:44,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:45,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:13:45,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 673 transitions, 12366 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:45,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:45,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:13:45,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:47,519 INFO L124 PetriNetUnfolderBase]: 5239/8116 cut-off events. [2024-06-28 00:13:47,519 INFO L125 PetriNetUnfolderBase]: For 624474/624478 co-relation queries the response was YES. [2024-06-28 00:13:47,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69149 conditions, 8116 events. 5239/8116 cut-off events. For 624474/624478 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 49384 event pairs, 1971 based on Foata normal form. 10/8126 useless extension candidates. Maximal degree in co-relation 69012. Up to 7908 conditions per place. [2024-06-28 00:13:47,657 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 677 selfloop transitions, 22 changer transitions 0/702 dead transitions. [2024-06-28 00:13:47,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 702 transitions, 14004 flow [2024-06-28 00:13:47,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2024-06-28 00:13:47,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36944444444444446 [2024-06-28 00:13:47,658 INFO L175 Difference]: Start difference. First operand has 300 places, 673 transitions, 12366 flow. Second operand 9 states and 133 transitions. [2024-06-28 00:13:47,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 702 transitions, 14004 flow [2024-06-28 00:13:49,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 702 transitions, 13674 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-28 00:13:49,156 INFO L231 Difference]: Finished difference. Result has 300 places, 677 transitions, 12243 flow [2024-06-28 00:13:49,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12036, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12243, PETRI_PLACES=300, PETRI_TRANSITIONS=677} [2024-06-28 00:13:49,157 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 259 predicate places. [2024-06-28 00:13:49,157 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 677 transitions, 12243 flow [2024-06-28 00:13:49,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:49,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:49,157 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:13:49,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 00:13:49,157 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:49,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1084618005, now seen corresponding path program 8 times [2024-06-28 00:13:49,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:49,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065871285] [2024-06-28 00:13:49,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:49,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:51,231 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:13:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065871285] [2024-06-28 00:13:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065871285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361677997] [2024-06-28 00:13:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:51,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:51,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:13:51,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 677 transitions, 12243 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:51,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:51,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:13:51,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:53,981 INFO L124 PetriNetUnfolderBase]: 5322/8292 cut-off events. [2024-06-28 00:13:53,982 INFO L125 PetriNetUnfolderBase]: For 683355/683359 co-relation queries the response was YES. [2024-06-28 00:13:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69682 conditions, 8292 events. 5322/8292 cut-off events. For 683355/683359 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 51244 event pairs, 1985 based on Foata normal form. 30/8322 useless extension candidates. Maximal degree in co-relation 69544. Up to 7643 conditions per place. [2024-06-28 00:13:54,077 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 612 selfloop transitions, 105 changer transitions 0/720 dead transitions. [2024-06-28 00:13:54,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 720 transitions, 14056 flow [2024-06-28 00:13:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-28 00:13:54,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4361111111111111 [2024-06-28 00:13:54,079 INFO L175 Difference]: Start difference. First operand has 300 places, 677 transitions, 12243 flow. Second operand 9 states and 157 transitions. [2024-06-28 00:13:54,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 720 transitions, 14056 flow [2024-06-28 00:13:55,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 720 transitions, 13883 flow, removed 64 selfloop flow, removed 8 redundant places. [2024-06-28 00:13:55,275 INFO L231 Difference]: Finished difference. Result has 301 places, 679 transitions, 12358 flow [2024-06-28 00:13:55,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12070, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12358, PETRI_PLACES=301, PETRI_TRANSITIONS=679} [2024-06-28 00:13:55,275 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 260 predicate places. [2024-06-28 00:13:55,275 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 679 transitions, 12358 flow [2024-06-28 00:13:55,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:55,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:55,276 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:13:55,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 00:13:55,276 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:55,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1698221921, now seen corresponding path program 11 times [2024-06-28 00:13:55,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:55,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492399972] [2024-06-28 00:13:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:55,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:56,909 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:13:56,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:56,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492399972] [2024-06-28 00:13:56,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492399972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:56,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:56,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777165519] [2024-06-28 00:13:56,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:56,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:56,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:56,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:56,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:13:56,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 679 transitions, 12358 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:13:56,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:56,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:13:56,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:59,393 INFO L124 PetriNetUnfolderBase]: 5391/8375 cut-off events. [2024-06-28 00:13:59,393 INFO L125 PetriNetUnfolderBase]: For 666798/666802 co-relation queries the response was YES. [2024-06-28 00:13:59,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71644 conditions, 8375 events. 5391/8375 cut-off events. For 666798/666802 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 51574 event pairs, 2037 based on Foata normal form. 10/8385 useless extension candidates. Maximal degree in co-relation 71505. Up to 8017 conditions per place. [2024-06-28 00:13:59,510 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 658 selfloop transitions, 61 changer transitions 0/722 dead transitions. [2024-06-28 00:13:59,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 722 transitions, 14608 flow [2024-06-28 00:13:59,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-28 00:13:59,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-28 00:13:59,511 INFO L175 Difference]: Start difference. First operand has 301 places, 679 transitions, 12358 flow. Second operand 9 states and 138 transitions. [2024-06-28 00:13:59,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 722 transitions, 14608 flow [2024-06-28 00:14:01,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 722 transitions, 14358 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-28 00:14:01,170 INFO L231 Difference]: Finished difference. Result has 303 places, 687 transitions, 12565 flow [2024-06-28 00:14:01,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12118, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12565, PETRI_PLACES=303, PETRI_TRANSITIONS=687} [2024-06-28 00:14:01,171 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 262 predicate places. [2024-06-28 00:14:01,171 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 687 transitions, 12565 flow [2024-06-28 00:14:01,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:14:01,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:01,171 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:14:01,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 00:14:01,171 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:01,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1947565151, now seen corresponding path program 12 times [2024-06-28 00:14:01,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:01,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279312933] [2024-06-28 00:14:01,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:01,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:02,860 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:14:02,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:02,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279312933] [2024-06-28 00:14:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279312933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:02,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116224928] [2024-06-28 00:14:02,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:02,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:02,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:02,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:02,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:14:02,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 687 transitions, 12565 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:14:02,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:02,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:14:02,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:05,345 INFO L124 PetriNetUnfolderBase]: 5378/8356 cut-off events. [2024-06-28 00:14:05,345 INFO L125 PetriNetUnfolderBase]: For 668496/668500 co-relation queries the response was YES. [2024-06-28 00:14:05,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70898 conditions, 8356 events. 5378/8356 cut-off events. For 668496/668500 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 51445 event pairs, 2036 based on Foata normal form. 10/8366 useless extension candidates. Maximal degree in co-relation 70758. Up to 8066 conditions per place. [2024-06-28 00:14:05,486 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 653 selfloop transitions, 61 changer transitions 0/717 dead transitions. [2024-06-28 00:14:05,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 717 transitions, 14197 flow [2024-06-28 00:14:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-28 00:14:05,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-28 00:14:05,488 INFO L175 Difference]: Start difference. First operand has 303 places, 687 transitions, 12565 flow. Second operand 9 states and 135 transitions. [2024-06-28 00:14:05,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 717 transitions, 14197 flow [2024-06-28 00:14:07,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 717 transitions, 13869 flow, removed 136 selfloop flow, removed 5 redundant places. [2024-06-28 00:14:07,404 INFO L231 Difference]: Finished difference. Result has 307 places, 687 transitions, 12374 flow [2024-06-28 00:14:07,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12237, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12374, PETRI_PLACES=307, PETRI_TRANSITIONS=687} [2024-06-28 00:14:07,404 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 266 predicate places. [2024-06-28 00:14:07,404 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 687 transitions, 12374 flow [2024-06-28 00:14:07,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:14:07,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:07,405 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:14:07,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 00:14:07,405 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:07,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1397215087, now seen corresponding path program 13 times [2024-06-28 00:14:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:07,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137136759] [2024-06-28 00:14:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:09,197 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:14:09,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:09,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137136759] [2024-06-28 00:14:09,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137136759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:09,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:09,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:14:09,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738855935] [2024-06-28 00:14:09,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:09,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:14:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:14:09,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:14:09,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:14:09,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 687 transitions, 12374 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:14:09,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:09,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:14:09,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:11,655 INFO L124 PetriNetUnfolderBase]: 5406/8412 cut-off events. [2024-06-28 00:14:11,655 INFO L125 PetriNetUnfolderBase]: For 682154/682158 co-relation queries the response was YES. [2024-06-28 00:14:11,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71120 conditions, 8412 events. 5406/8412 cut-off events. For 682154/682158 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 52025 event pairs, 2020 based on Foata normal form. 6/8418 useless extension candidates. Maximal degree in co-relation 70978. Up to 7950 conditions per place. [2024-06-28 00:14:11,769 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 587 selfloop transitions, 134 changer transitions 0/724 dead transitions. [2024-06-28 00:14:11,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 724 transitions, 14257 flow [2024-06-28 00:14:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-28 00:14:11,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-28 00:14:11,771 INFO L175 Difference]: Start difference. First operand has 307 places, 687 transitions, 12374 flow. Second operand 9 states and 143 transitions. [2024-06-28 00:14:11,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 724 transitions, 14257 flow [2024-06-28 00:14:13,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 724 transitions, 14162 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 00:14:13,208 INFO L231 Difference]: Finished difference. Result has 309 places, 691 transitions, 12729 flow [2024-06-28 00:14:13,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12279, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12729, PETRI_PLACES=309, PETRI_TRANSITIONS=691} [2024-06-28 00:14:13,208 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 268 predicate places. [2024-06-28 00:14:13,209 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 691 transitions, 12729 flow [2024-06-28 00:14:13,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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:14:13,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:13,209 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:14:13,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 00:14:13,209 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:13,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:13,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1397368909, now seen corresponding path program 9 times [2024-06-28 00:14:13,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:13,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802769658] [2024-06-28 00:14:13,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:13,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:15,978 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:14:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802769658] [2024-06-28 00:14:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802769658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:15,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:15,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751460778] [2024-06-28 00:14:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:15,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:16,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:14:16,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 691 transitions, 12729 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:14:16,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:16,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:14:16,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:18,598 INFO L124 PetriNetUnfolderBase]: 5456/8509 cut-off events. [2024-06-28 00:14:18,598 INFO L125 PetriNetUnfolderBase]: For 689427/689431 co-relation queries the response was YES. [2024-06-28 00:14:18,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70442 conditions, 8509 events. 5456/8509 cut-off events. For 689427/689431 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 52891 event pairs, 1939 based on Foata normal form. 24/8533 useless extension candidates. Maximal degree in co-relation 70299. Up to 7473 conditions per place. [2024-06-28 00:14:18,709 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 622 selfloop transitions, 113 changer transitions 0/738 dead transitions. [2024-06-28 00:14:18,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 738 transitions, 14566 flow [2024-06-28 00:14:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-28 00:14:18,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2024-06-28 00:14:18,717 INFO L175 Difference]: Start difference. First operand has 309 places, 691 transitions, 12729 flow. Second operand 9 states and 161 transitions. [2024-06-28 00:14:18,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 738 transitions, 14566 flow [2024-06-28 00:14:20,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 738 transitions, 14239 flow, removed 72 selfloop flow, removed 6 redundant places. [2024-06-28 00:14:20,233 INFO L231 Difference]: Finished difference. Result has 313 places, 693 transitions, 12698 flow [2024-06-28 00:14:20,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12402, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12698, PETRI_PLACES=313, PETRI_TRANSITIONS=693} [2024-06-28 00:14:20,233 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 272 predicate places. [2024-06-28 00:14:20,233 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 693 transitions, 12698 flow [2024-06-28 00:14:20,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:14:20,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:20,234 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:14:20,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 00:14:20,234 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:20,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 539546905, now seen corresponding path program 14 times [2024-06-28 00:14:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:20,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010642015] [2024-06-28 00:14:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:20,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:22,166 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:14:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010642015] [2024-06-28 00:14:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010642015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:22,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400979251] [2024-06-28 00:14:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:22,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:22,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:22,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:22,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:14:22,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 693 transitions, 12698 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:14:22,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:22,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:14:22,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:24,579 INFO L124 PetriNetUnfolderBase]: 5484/8544 cut-off events. [2024-06-28 00:14:24,580 INFO L125 PetriNetUnfolderBase]: For 663184/663188 co-relation queries the response was YES. [2024-06-28 00:14:24,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71198 conditions, 8544 events. 5484/8544 cut-off events. For 663184/663188 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 53130 event pairs, 2026 based on Foata normal form. 6/8550 useless extension candidates. Maximal degree in co-relation 71053. Up to 7990 conditions per place. [2024-06-28 00:14:24,705 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 606 selfloop transitions, 132 changer transitions 0/741 dead transitions. [2024-06-28 00:14:24,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 741 transitions, 15117 flow [2024-06-28 00:14:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-28 00:14:24,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-28 00:14:24,707 INFO L175 Difference]: Start difference. First operand has 313 places, 693 transitions, 12698 flow. Second operand 9 states and 144 transitions. [2024-06-28 00:14:24,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 741 transitions, 15117 flow [2024-06-28 00:14:26,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 741 transitions, 14745 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-28 00:14:26,431 INFO L231 Difference]: Finished difference. Result has 314 places, 700 transitions, 12913 flow [2024-06-28 00:14:26,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12336, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12913, PETRI_PLACES=314, PETRI_TRANSITIONS=700} [2024-06-28 00:14:26,432 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 273 predicate places. [2024-06-28 00:14:26,432 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 700 transitions, 12913 flow [2024-06-28 00:14:26,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:14:26,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:26,432 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:14:26,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 00:14:26,432 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:26,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1078903713, now seen corresponding path program 15 times [2024-06-28 00:14:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270631539] [2024-06-28 00:14:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:28,340 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:14:28,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:28,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270631539] [2024-06-28 00:14:28,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270631539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:28,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:28,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758285119] [2024-06-28 00:14:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:28,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:28,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:28,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:28,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:28,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:14:28,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 700 transitions, 12913 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:14:28,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:28,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:14:28,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:31,020 INFO L124 PetriNetUnfolderBase]: 5471/8529 cut-off events. [2024-06-28 00:14:31,020 INFO L125 PetriNetUnfolderBase]: For 661335/661339 co-relation queries the response was YES. [2024-06-28 00:14:31,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70266 conditions, 8529 events. 5471/8529 cut-off events. For 661335/661339 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 53090 event pairs, 2045 based on Foata normal form. 6/8535 useless extension candidates. Maximal degree in co-relation 70120. Up to 8065 conditions per place. [2024-06-28 00:14:31,128 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 612 selfloop transitions, 126 changer transitions 0/741 dead transitions. [2024-06-28 00:14:31,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 741 transitions, 14794 flow [2024-06-28 00:14:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-28 00:14:31,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2024-06-28 00:14:31,129 INFO L175 Difference]: Start difference. First operand has 314 places, 700 transitions, 12913 flow. Second operand 9 states and 142 transitions. [2024-06-28 00:14:31,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 741 transitions, 14794 flow [2024-06-28 00:14:32,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 741 transitions, 14428 flow, removed 152 selfloop flow, removed 4 redundant places. [2024-06-28 00:14:32,879 INFO L231 Difference]: Finished difference. Result has 319 places, 700 transitions, 12811 flow [2024-06-28 00:14:32,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12547, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12811, PETRI_PLACES=319, PETRI_TRANSITIONS=700} [2024-06-28 00:14:32,879 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 278 predicate places. [2024-06-28 00:14:32,879 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 700 transitions, 12811 flow [2024-06-28 00:14:32,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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:14:32,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:32,879 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:14:32,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 00:14:32,879 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:14:32,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:32,880 INFO L85 PathProgramCache]: Analyzing trace with hash -836861537, now seen corresponding path program 1 times [2024-06-28 00:14:32,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:32,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445561837] [2024-06-28 00:14:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:32,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:34,302 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:14:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445561837] [2024-06-28 00:14:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445561837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:14:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288488166] [2024-06-28 00:14:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:34,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:14:34,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:34,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:14:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:14:34,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:14:34,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 700 transitions, 12811 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:14:34,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:34,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:14:34,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:36,609 INFO L124 PetriNetUnfolderBase]: 5462/8508 cut-off events. [2024-06-28 00:14:36,610 INFO L125 PetriNetUnfolderBase]: For 652838/652838 co-relation queries the response was YES. [2024-06-28 00:14:36,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69642 conditions, 8508 events. 5462/8508 cut-off events. For 652838/652838 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 52747 event pairs, 1989 based on Foata normal form. 3/8511 useless extension candidates. Maximal degree in co-relation 69494. Up to 8344 conditions per place. [2024-06-28 00:14:36,725 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 704 selfloop transitions, 20 changer transitions 0/727 dead transitions. [2024-06-28 00:14:36,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 727 transitions, 14446 flow [2024-06-28 00:14:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:14:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:14:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-28 00:14:36,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-28 00:14:36,726 INFO L175 Difference]: Start difference. First operand has 319 places, 700 transitions, 12811 flow. Second operand 8 states and 113 transitions. [2024-06-28 00:14:36,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 727 transitions, 14446 flow [2024-06-28 00:14:38,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 727 transitions, 14194 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-28 00:14:38,445 INFO L231 Difference]: Finished difference. Result has 322 places, 712 transitions, 12773 flow [2024-06-28 00:14:38,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12559, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12773, PETRI_PLACES=322, PETRI_TRANSITIONS=712} [2024-06-28 00:14:38,446 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 281 predicate places. [2024-06-28 00:14:38,446 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 712 transitions, 12773 flow [2024-06-28 00:14:38,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:14:38,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:38,446 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:14:38,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 00:14:38,446 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:14:38,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:38,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1699606525, now seen corresponding path program 1 times [2024-06-28 00:14:38,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:38,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955212081] [2024-06-28 00:14:38,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:40,165 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:14:40,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:40,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955212081] [2024-06-28 00:14:40,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955212081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:40,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:40,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:14:40,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291646394] [2024-06-28 00:14:40,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:40,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:14:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:14:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:14:40,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:14:40,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 712 transitions, 12773 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:14:40,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:40,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:14:40,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:42,655 INFO L124 PetriNetUnfolderBase]: 5472/8523 cut-off events. [2024-06-28 00:14:42,655 INFO L125 PetriNetUnfolderBase]: For 662395/662399 co-relation queries the response was YES. [2024-06-28 00:14:42,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69876 conditions, 8523 events. 5472/8523 cut-off events. For 662395/662399 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 52854 event pairs, 1996 based on Foata normal form. 6/8529 useless extension candidates. Maximal degree in co-relation 69725. Up to 8344 conditions per place. [2024-06-28 00:14:42,769 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 712 selfloop transitions, 22 changer transitions 0/737 dead transitions. [2024-06-28 00:14:42,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 737 transitions, 14553 flow [2024-06-28 00:14:42,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:14:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:14:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-28 00:14:42,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-28 00:14:42,770 INFO L175 Difference]: Start difference. First operand has 322 places, 712 transitions, 12773 flow. Second operand 6 states and 98 transitions. [2024-06-28 00:14:42,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 737 transitions, 14553 flow [2024-06-28 00:14:44,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 737 transitions, 14460 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-28 00:14:44,849 INFO L231 Difference]: Finished difference. Result has 326 places, 722 transitions, 12842 flow [2024-06-28 00:14:44,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12688, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12842, PETRI_PLACES=326, PETRI_TRANSITIONS=722} [2024-06-28 00:14:44,850 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 285 predicate places. [2024-06-28 00:14:44,850 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 722 transitions, 12842 flow [2024-06-28 00:14:44,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:14:44,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:44,850 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:14:44,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 00:14:44,850 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:14:44,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1272531923, now seen corresponding path program 2 times [2024-06-28 00:14:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:44,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291611982] [2024-06-28 00:14:44,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:46,861 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:14:46,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:46,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291611982] [2024-06-28 00:14:46,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291611982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:46,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:46,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:14:46,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787331912] [2024-06-28 00:14:46,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:46,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:14:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:46,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:14:46,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:14:46,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:14:46,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 722 transitions, 12842 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:14:46,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:46,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:14:46,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:49,346 INFO L124 PetriNetUnfolderBase]: 5486/8543 cut-off events. [2024-06-28 00:14:49,346 INFO L125 PetriNetUnfolderBase]: For 682866/682870 co-relation queries the response was YES. [2024-06-28 00:14:49,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70474 conditions, 8543 events. 5486/8543 cut-off events. For 682866/682870 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 52941 event pairs, 2003 based on Foata normal form. 10/8553 useless extension candidates. Maximal degree in co-relation 70319. Up to 8361 conditions per place. [2024-06-28 00:14:49,492 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 706 selfloop transitions, 26 changer transitions 0/735 dead transitions. [2024-06-28 00:14:49,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 735 transitions, 14388 flow [2024-06-28 00:14:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:14:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:14:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2024-06-28 00:14:49,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2024-06-28 00:14:49,494 INFO L175 Difference]: Start difference. First operand has 326 places, 722 transitions, 12842 flow. Second operand 7 states and 103 transitions. [2024-06-28 00:14:49,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 735 transitions, 14388 flow [2024-06-28 00:14:51,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 735 transitions, 14373 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-28 00:14:51,801 INFO L231 Difference]: Finished difference. Result has 332 places, 725 transitions, 12934 flow [2024-06-28 00:14:51,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12827, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12934, PETRI_PLACES=332, PETRI_TRANSITIONS=725} [2024-06-28 00:14:51,802 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 291 predicate places. [2024-06-28 00:14:51,802 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 725 transitions, 12934 flow [2024-06-28 00:14:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:14:51,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:51,802 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:14:51,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-28 00:14:51,802 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:14:51,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1692926521, now seen corresponding path program 1 times [2024-06-28 00:14:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883651505] [2024-06-28 00:14:51,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:51,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:54,602 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:14:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:54,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883651505] [2024-06-28 00:14:54,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883651505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:54,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:54,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932180251] [2024-06-28 00:14:54,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:54,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:54,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:54,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:54,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:14:54,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 725 transitions, 12934 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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:14:54,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:54,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:14:54,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:57,248 INFO L124 PetriNetUnfolderBase]: 5363/8389 cut-off events. [2024-06-28 00:14:57,248 INFO L125 PetriNetUnfolderBase]: For 696288/696414 co-relation queries the response was YES. [2024-06-28 00:14:57,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69856 conditions, 8389 events. 5363/8389 cut-off events. For 696288/696414 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 52311 event pairs, 1945 based on Foata normal form. 92/8435 useless extension candidates. Maximal degree in co-relation 69698. Up to 8143 conditions per place. [2024-06-28 00:14:57,382 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 684 selfloop transitions, 23 changer transitions 0/737 dead transitions. [2024-06-28 00:14:57,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 737 transitions, 14408 flow [2024-06-28 00:14:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:14:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:14:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2024-06-28 00:14:57,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-28 00:14:57,384 INFO L175 Difference]: Start difference. First operand has 332 places, 725 transitions, 12934 flow. Second operand 8 states and 115 transitions. [2024-06-28 00:14:57,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 737 transitions, 14408 flow [2024-06-28 00:14:59,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 737 transitions, 14331 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-28 00:14:59,697 INFO L231 Difference]: Finished difference. Result has 335 places, 727 transitions, 12943 flow [2024-06-28 00:14:59,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12857, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12943, PETRI_PLACES=335, PETRI_TRANSITIONS=727} [2024-06-28 00:14:59,697 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 294 predicate places. [2024-06-28 00:14:59,697 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 727 transitions, 12943 flow [2024-06-28 00:14:59,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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:14:59,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:59,698 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:14:59,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-28 00:14:59,698 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:14:59,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash 638730512, now seen corresponding path program 1 times [2024-06-28 00:14:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:59,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016023276] [2024-06-28 00:14:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:01,592 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:15:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:01,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016023276] [2024-06-28 00:15:01,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016023276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:01,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:01,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:15:01,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342681729] [2024-06-28 00:15:01,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:01,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:15:01,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:01,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:15:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:15:01,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:15:01,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 727 transitions, 12943 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:15:01,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:01,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:15:01,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:04,326 INFO L124 PetriNetUnfolderBase]: 5481/8604 cut-off events. [2024-06-28 00:15:04,326 INFO L125 PetriNetUnfolderBase]: For 686448/686454 co-relation queries the response was YES. [2024-06-28 00:15:04,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71189 conditions, 8604 events. 5481/8604 cut-off events. For 686448/686454 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 54269 event pairs, 1678 based on Foata normal form. 7/8611 useless extension candidates. Maximal degree in co-relation 71030. Up to 8247 conditions per place. [2024-06-28 00:15:04,443 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 720 selfloop transitions, 60 changer transitions 0/783 dead transitions. [2024-06-28 00:15:04,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 783 transitions, 15046 flow [2024-06-28 00:15:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-28 00:15:04,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-06-28 00:15:04,444 INFO L175 Difference]: Start difference. First operand has 335 places, 727 transitions, 12943 flow. Second operand 9 states and 148 transitions. [2024-06-28 00:15:04,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 783 transitions, 15046 flow [2024-06-28 00:15:06,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 783 transitions, 14956 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-28 00:15:06,975 INFO L231 Difference]: Finished difference. Result has 341 places, 750 transitions, 13302 flow [2024-06-28 00:15:06,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12855, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13302, PETRI_PLACES=341, PETRI_TRANSITIONS=750} [2024-06-28 00:15:06,976 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 300 predicate places. [2024-06-28 00:15:06,976 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 750 transitions, 13302 flow [2024-06-28 00:15:06,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:15:06,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:06,976 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:15:06,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-28 00:15:06,976 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:06,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1627580810, now seen corresponding path program 1 times [2024-06-28 00:15:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:06,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232605064] [2024-06-28 00:15:06,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:06,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:09,193 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:15:09,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:09,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232605064] [2024-06-28 00:15:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232605064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:15:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355970424] [2024-06-28 00:15:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:09,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:15:09,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:15:09,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:15:09,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:15:09,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 750 transitions, 13302 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:15:09,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:09,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:15:09,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:11,970 INFO L124 PetriNetUnfolderBase]: 5549/8700 cut-off events. [2024-06-28 00:15:11,971 INFO L125 PetriNetUnfolderBase]: For 759658/759666 co-relation queries the response was YES. [2024-06-28 00:15:12,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72953 conditions, 8700 events. 5549/8700 cut-off events. For 759658/759666 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 54820 event pairs, 1550 based on Foata normal form. 22/8722 useless extension candidates. Maximal degree in co-relation 72790. Up to 7466 conditions per place. [2024-06-28 00:15:12,120 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 437 selfloop transitions, 352 changer transitions 0/792 dead transitions. [2024-06-28 00:15:12,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 792 transitions, 15239 flow [2024-06-28 00:15:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 00:15:12,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-28 00:15:12,122 INFO L175 Difference]: Start difference. First operand has 341 places, 750 transitions, 13302 flow. Second operand 9 states and 155 transitions. [2024-06-28 00:15:12,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 792 transitions, 15239 flow [2024-06-28 00:15:14,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 792 transitions, 15169 flow, removed 34 selfloop flow, removed 1 redundant places. [2024-06-28 00:15:14,406 INFO L231 Difference]: Finished difference. Result has 349 places, 752 transitions, 14047 flow [2024-06-28 00:15:14,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13232, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=350, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14047, PETRI_PLACES=349, PETRI_TRANSITIONS=752} [2024-06-28 00:15:14,406 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 308 predicate places. [2024-06-28 00:15:14,407 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 752 transitions, 14047 flow [2024-06-28 00:15:14,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:15:14,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:14,407 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:15:14,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-28 00:15:14,407 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:15:14,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash -965771254, now seen corresponding path program 2 times [2024-06-28 00:15:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202705727] [2024-06-28 00:15:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:14,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:16,618 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:15:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202705727] [2024-06-28 00:15:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202705727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:15:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036221361] [2024-06-28 00:15:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:16,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:15:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:16,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:15:16,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:15:16,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:15:16,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 752 transitions, 14047 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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:15:16,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:16,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:15:16,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:19,164 INFO L124 PetriNetUnfolderBase]: 5575/8758 cut-off events. [2024-06-28 00:15:19,164 INFO L125 PetriNetUnfolderBase]: For 740166/740170 co-relation queries the response was YES. [2024-06-28 00:15:19,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74623 conditions, 8758 events. 5575/8758 cut-off events. For 740166/740170 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 55567 event pairs, 1705 based on Foata normal form. 5/8763 useless extension candidates. Maximal degree in co-relation 74457. Up to 8326 conditions per place. [2024-06-28 00:15:19,316 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 708 selfloop transitions, 84 changer transitions 0/795 dead transitions. [2024-06-28 00:15:19,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 795 transitions, 16062 flow [2024-06-28 00:15:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:15:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:15:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 00:15:19,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-28 00:15:19,317 INFO L175 Difference]: Start difference. First operand has 349 places, 752 transitions, 14047 flow. Second operand 8 states and 148 transitions. [2024-06-28 00:15:19,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 795 transitions, 16062 flow [2024-06-28 00:15:22,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 795 transitions, 15287 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-28 00:15:22,297 INFO L231 Difference]: Finished difference. Result has 353 places, 763 transitions, 13646 flow [2024-06-28 00:15:22,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13272, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13646, PETRI_PLACES=353, PETRI_TRANSITIONS=763} [2024-06-28 00:15:22,297 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 312 predicate places. [2024-06-28 00:15:22,298 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 763 transitions, 13646 flow [2024-06-28 00:15:22,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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:15:22,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:22,298 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:15:22,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-28 00:15:22,298 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:15:22,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash -956824654, now seen corresponding path program 3 times [2024-06-28 00:15:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:22,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915130102] [2024-06-28 00:15:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:24,423 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:15:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:24,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915130102] [2024-06-28 00:15:24,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915130102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:24,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:24,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:15:24,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143994816] [2024-06-28 00:15:24,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:24,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:15:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:24,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:15:24,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:15:24,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:15:24,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 763 transitions, 13646 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:15:24,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:24,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:15:24,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:27,587 INFO L124 PetriNetUnfolderBase]: 5620/8822 cut-off events. [2024-06-28 00:15:27,587 INFO L125 PetriNetUnfolderBase]: For 753595/753597 co-relation queries the response was YES. [2024-06-28 00:15:27,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74613 conditions, 8822 events. 5620/8822 cut-off events. For 753595/753597 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 55995 event pairs, 1714 based on Foata normal form. 5/8827 useless extension candidates. Maximal degree in co-relation 74443. Up to 8467 conditions per place. [2024-06-28 00:15:27,736 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 742 selfloop transitions, 83 changer transitions 0/828 dead transitions. [2024-06-28 00:15:27,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 828 transitions, 15917 flow [2024-06-28 00:15:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:15:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:15:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-28 00:15:27,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925 [2024-06-28 00:15:27,737 INFO L175 Difference]: Start difference. First operand has 353 places, 763 transitions, 13646 flow. Second operand 10 states and 157 transitions. [2024-06-28 00:15:27,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 828 transitions, 15917 flow [2024-06-28 00:15:30,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 828 transitions, 15800 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-28 00:15:30,350 INFO L231 Difference]: Finished difference. Result has 363 places, 801 transitions, 14330 flow [2024-06-28 00:15:30,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13559, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14330, PETRI_PLACES=363, PETRI_TRANSITIONS=801} [2024-06-28 00:15:30,351 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 322 predicate places. [2024-06-28 00:15:30,351 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 801 transitions, 14330 flow [2024-06-28 00:15:30,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:15:30,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:30,351 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:15:30,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-28 00:15:30,352 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:30,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash 816633932, now seen corresponding path program 2 times [2024-06-28 00:15:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:30,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576488471] [2024-06-28 00:15:30,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:30,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:32,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:15:32,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:32,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576488471] [2024-06-28 00:15:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576488471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:32,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:32,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:15:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724773116] [2024-06-28 00:15:32,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:32,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:15:32,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:32,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:15:32,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:15:32,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:15:32,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 801 transitions, 14330 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:15:32,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:32,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:15:32,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:35,673 INFO L124 PetriNetUnfolderBase]: 5574/8746 cut-off events. [2024-06-28 00:15:35,674 INFO L125 PetriNetUnfolderBase]: For 746406/746412 co-relation queries the response was YES. [2024-06-28 00:15:35,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72621 conditions, 8746 events. 5574/8746 cut-off events. For 746406/746412 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 55335 event pairs, 1636 based on Foata normal form. 26/8772 useless extension candidates. Maximal degree in co-relation 72447. Up to 7595 conditions per place. [2024-06-28 00:15:35,820 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 637 selfloop transitions, 204 changer transitions 0/844 dead transitions. [2024-06-28 00:15:35,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 844 transitions, 16381 flow [2024-06-28 00:15:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 00:15:35,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-28 00:15:35,822 INFO L175 Difference]: Start difference. First operand has 363 places, 801 transitions, 14330 flow. Second operand 9 states and 165 transitions. [2024-06-28 00:15:35,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 844 transitions, 16381 flow [2024-06-28 00:15:38,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 844 transitions, 16274 flow, removed 48 selfloop flow, removed 2 redundant places. [2024-06-28 00:15:38,265 INFO L231 Difference]: Finished difference. Result has 370 places, 801 transitions, 14650 flow [2024-06-28 00:15:38,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14223, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14650, PETRI_PLACES=370, PETRI_TRANSITIONS=801} [2024-06-28 00:15:38,266 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 329 predicate places. [2024-06-28 00:15:38,266 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 801 transitions, 14650 flow [2024-06-28 00:15:38,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:15:38,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:38,266 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:15:38,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-28 00:15:38,266 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:38,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:38,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2011261784, now seen corresponding path program 3 times [2024-06-28 00:15:38,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252527707] [2024-06-28 00:15:38,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:40,868 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:15:40,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252527707] [2024-06-28 00:15:40,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252527707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:40,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:40,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:15:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177278996] [2024-06-28 00:15:40,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:40,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:15:40,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:40,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:15:40,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:15:41,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:15:41,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 801 transitions, 14650 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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:15:41,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:41,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:15:41,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:44,021 INFO L124 PetriNetUnfolderBase]: 5642/8874 cut-off events. [2024-06-28 00:15:44,021 INFO L125 PetriNetUnfolderBase]: For 753390/753396 co-relation queries the response was YES. [2024-06-28 00:15:44,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74288 conditions, 8874 events. 5642/8874 cut-off events. For 753390/753396 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 56569 event pairs, 1708 based on Foata normal form. 20/8894 useless extension candidates. Maximal degree in co-relation 74112. Up to 8042 conditions per place. [2024-06-28 00:15:44,160 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 649 selfloop transitions, 199 changer transitions 0/851 dead transitions. [2024-06-28 00:15:44,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 851 transitions, 16844 flow [2024-06-28 00:15:44,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-28 00:15:44,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-28 00:15:44,162 INFO L175 Difference]: Start difference. First operand has 370 places, 801 transitions, 14650 flow. Second operand 9 states and 168 transitions. [2024-06-28 00:15:44,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 851 transitions, 16844 flow [2024-06-28 00:15:46,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 851 transitions, 16341 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-28 00:15:46,357 INFO L231 Difference]: Finished difference. Result has 369 places, 803 transitions, 14658 flow [2024-06-28 00:15:46,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14149, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14658, PETRI_PLACES=369, PETRI_TRANSITIONS=803} [2024-06-28 00:15:46,357 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 328 predicate places. [2024-06-28 00:15:46,358 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 803 transitions, 14658 flow [2024-06-28 00:15:46,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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:15:46,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:46,358 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:15:46,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-28 00:15:46,358 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:46,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:46,358 INFO L85 PathProgramCache]: Analyzing trace with hash 982874222, now seen corresponding path program 4 times [2024-06-28 00:15:46,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:46,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27477179] [2024-06-28 00:15:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:49,165 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:15:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27477179] [2024-06-28 00:15:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27477179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:49,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:15:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135831484] [2024-06-28 00:15:49,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:49,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:15:49,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:15:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:15:49,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:15:49,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 803 transitions, 14658 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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:15:49,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:49,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:15:49,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:52,261 INFO L124 PetriNetUnfolderBase]: 5710/8992 cut-off events. [2024-06-28 00:15:52,262 INFO L125 PetriNetUnfolderBase]: For 758845/758851 co-relation queries the response was YES. [2024-06-28 00:15:52,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74964 conditions, 8992 events. 5710/8992 cut-off events. For 758845/758851 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 57629 event pairs, 1744 based on Foata normal form. 20/9012 useless extension candidates. Maximal degree in co-relation 74789. Up to 8136 conditions per place. [2024-06-28 00:15:52,429 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 654 selfloop transitions, 203 changer transitions 0/860 dead transitions. [2024-06-28 00:15:52,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 860 transitions, 16896 flow [2024-06-28 00:15:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:15:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:15:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-06-28 00:15:52,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-06-28 00:15:52,431 INFO L175 Difference]: Start difference. First operand has 369 places, 803 transitions, 14658 flow. Second operand 11 states and 196 transitions. [2024-06-28 00:15:52,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 860 transitions, 16896 flow [2024-06-28 00:15:55,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 860 transitions, 16421 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-06-28 00:15:55,170 INFO L231 Difference]: Finished difference. Result has 373 places, 805 transitions, 14704 flow [2024-06-28 00:15:55,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14183, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14704, PETRI_PLACES=373, PETRI_TRANSITIONS=805} [2024-06-28 00:15:55,171 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 332 predicate places. [2024-06-28 00:15:55,171 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 805 transitions, 14704 flow [2024-06-28 00:15:55,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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:15:55,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:55,171 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:15:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-28 00:15:55,171 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:55,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash 989360972, now seen corresponding path program 5 times [2024-06-28 00:15:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:55,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414911017] [2024-06-28 00:15:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:57,780 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:15:57,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:57,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414911017] [2024-06-28 00:15:57,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414911017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:57,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:57,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:15:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065183780] [2024-06-28 00:15:57,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:57,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:15:57,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:57,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:15:57,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:15:57,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:15:57,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 805 transitions, 14704 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:15:57,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:57,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:15:57,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:00,887 INFO L124 PetriNetUnfolderBase]: 5778/9108 cut-off events. [2024-06-28 00:16:00,887 INFO L125 PetriNetUnfolderBase]: For 777667/777673 co-relation queries the response was YES. [2024-06-28 00:16:01,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75717 conditions, 9108 events. 5778/9108 cut-off events. For 777667/777673 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 58619 event pairs, 1736 based on Foata normal form. 20/9128 useless extension candidates. Maximal degree in co-relation 75541. Up to 8055 conditions per place. [2024-06-28 00:16:01,050 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 626 selfloop transitions, 230 changer transitions 0/859 dead transitions. [2024-06-28 00:16:01,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 859 transitions, 16865 flow [2024-06-28 00:16:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:16:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:16:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 192 transitions. [2024-06-28 00:16:01,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-28 00:16:01,052 INFO L175 Difference]: Start difference. First operand has 373 places, 805 transitions, 14704 flow. Second operand 12 states and 192 transitions. [2024-06-28 00:16:01,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 859 transitions, 16865 flow [2024-06-28 00:16:03,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 859 transitions, 16378 flow, removed 44 selfloop flow, removed 9 redundant places. [2024-06-28 00:16:03,451 INFO L231 Difference]: Finished difference. Result has 376 places, 807 transitions, 14796 flow [2024-06-28 00:16:03,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14217, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14796, PETRI_PLACES=376, PETRI_TRANSITIONS=807} [2024-06-28 00:16:03,452 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 335 predicate places. [2024-06-28 00:16:03,452 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 807 transitions, 14796 flow [2024-06-28 00:16:03,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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:16:03,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:03,452 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:16:03,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-28 00:16:03,453 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:16:03,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1263489002, now seen corresponding path program 4 times [2024-06-28 00:16:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:03,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496797996] [2024-06-28 00:16:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:05,529 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:16:05,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:05,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496797996] [2024-06-28 00:16:05,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496797996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:05,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:05,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:16:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729916700] [2024-06-28 00:16:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:05,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:16:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:16:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:16:05,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:16:05,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 807 transitions, 14796 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:16:05,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:05,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:16:05,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:08,934 INFO L124 PetriNetUnfolderBase]: 5823/9169 cut-off events. [2024-06-28 00:16:08,935 INFO L125 PetriNetUnfolderBase]: For 739950/739952 co-relation queries the response was YES. [2024-06-28 00:16:09,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76087 conditions, 9169 events. 5823/9169 cut-off events. For 739950/739952 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 59034 event pairs, 1789 based on Foata normal form. 5/9174 useless extension candidates. Maximal degree in co-relation 75909. Up to 8753 conditions per place. [2024-06-28 00:16:09,067 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 729 selfloop transitions, 122 changer transitions 0/854 dead transitions. [2024-06-28 00:16:09,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 854 transitions, 16918 flow [2024-06-28 00:16:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:16:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:16:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-06-28 00:16:09,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-28 00:16:09,068 INFO L175 Difference]: Start difference. First operand has 376 places, 807 transitions, 14796 flow. Second operand 11 states and 164 transitions. [2024-06-28 00:16:09,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 854 transitions, 16918 flow [2024-06-28 00:16:11,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 854 transitions, 16373 flow, removed 46 selfloop flow, removed 10 redundant places. [2024-06-28 00:16:11,510 INFO L231 Difference]: Finished difference. Result has 377 places, 828 transitions, 14843 flow [2024-06-28 00:16:11,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14251, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14843, PETRI_PLACES=377, PETRI_TRANSITIONS=828} [2024-06-28 00:16:11,511 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 336 predicate places. [2024-06-28 00:16:11,511 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 828 transitions, 14843 flow [2024-06-28 00:16:11,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:16:11,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:11,511 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:16:11,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-28 00:16:11,511 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:16:11,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1874223722, now seen corresponding path program 5 times [2024-06-28 00:16:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:11,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462396122] [2024-06-28 00:16:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:13,657 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:16:13,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462396122] [2024-06-28 00:16:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462396122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:13,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:13,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:16:13,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744185477] [2024-06-28 00:16:13,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:13,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:16:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:16:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:16:13,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:16:13,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 828 transitions, 14843 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:16:13,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:13,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:16:13,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:17,147 INFO L124 PetriNetUnfolderBase]: 5838/9184 cut-off events. [2024-06-28 00:16:17,147 INFO L125 PetriNetUnfolderBase]: For 744510/744512 co-relation queries the response was YES. [2024-06-28 00:16:17,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75436 conditions, 9184 events. 5838/9184 cut-off events. For 744510/744512 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 58970 event pairs, 1571 based on Foata normal form. 5/9189 useless extension candidates. Maximal degree in co-relation 75257. Up to 8791 conditions per place. [2024-06-28 00:16:17,326 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 742 selfloop transitions, 114 changer transitions 0/859 dead transitions. [2024-06-28 00:16:17,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 859 transitions, 16764 flow [2024-06-28 00:16:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:16:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:16:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2024-06-28 00:16:17,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3659090909090909 [2024-06-28 00:16:17,328 INFO L175 Difference]: Start difference. First operand has 377 places, 828 transitions, 14843 flow. Second operand 11 states and 161 transitions. [2024-06-28 00:16:17,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 859 transitions, 16764 flow [2024-06-28 00:16:20,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 859 transitions, 16423 flow, removed 58 selfloop flow, removed 6 redundant places. [2024-06-28 00:16:20,030 INFO L231 Difference]: Finished difference. Result has 382 places, 836 transitions, 14865 flow [2024-06-28 00:16:20,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14515, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14865, PETRI_PLACES=382, PETRI_TRANSITIONS=836} [2024-06-28 00:16:20,031 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 341 predicate places. [2024-06-28 00:16:20,031 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 836 transitions, 14865 flow [2024-06-28 00:16:20,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:16:20,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:20,032 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:16:20,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-28 00:16:20,032 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:20,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1307791764, now seen corresponding path program 6 times [2024-06-28 00:16:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:20,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017156906] [2024-06-28 00:16:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:22,181 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:16:22,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:22,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017156906] [2024-06-28 00:16:22,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017156906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:22,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:22,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293483034] [2024-06-28 00:16:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:22,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:22,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:16:22,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 836 transitions, 14865 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:16:22,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:22,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:16:22,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:25,264 INFO L124 PetriNetUnfolderBase]: 5979/9440 cut-off events. [2024-06-28 00:16:25,264 INFO L125 PetriNetUnfolderBase]: For 804613/804617 co-relation queries the response was YES. [2024-06-28 00:16:25,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76788 conditions, 9440 events. 5979/9440 cut-off events. For 804613/804617 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 61287 event pairs, 2169 based on Foata normal form. 18/9458 useless extension candidates. Maximal degree in co-relation 76609. Up to 8839 conditions per place. [2024-06-28 00:16:25,433 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 791 selfloop transitions, 86 changer transitions 0/880 dead transitions. [2024-06-28 00:16:25,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 880 transitions, 17012 flow [2024-06-28 00:16:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:16:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:16:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 00:16:25,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-28 00:16:25,437 INFO L175 Difference]: Start difference. First operand has 382 places, 836 transitions, 14865 flow. Second operand 8 states and 134 transitions. [2024-06-28 00:16:25,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 880 transitions, 17012 flow [2024-06-28 00:16:28,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 880 transitions, 16757 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-28 00:16:28,283 INFO L231 Difference]: Finished difference. Result has 386 places, 848 transitions, 15013 flow [2024-06-28 00:16:28,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14610, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15013, PETRI_PLACES=386, PETRI_TRANSITIONS=848} [2024-06-28 00:16:28,284 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 345 predicate places. [2024-06-28 00:16:28,284 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 848 transitions, 15013 flow [2024-06-28 00:16:28,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:16:28,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:28,284 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:16:28,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-28 00:16:28,285 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:28,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash 244978848, now seen corresponding path program 7 times [2024-06-28 00:16:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:28,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840748148] [2024-06-28 00:16:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:30,319 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:16:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840748148] [2024-06-28 00:16:30,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840748148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:30,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:30,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:30,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786578100] [2024-06-28 00:16:30,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:30,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:30,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:30,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:30,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:16:30,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 848 transitions, 15013 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:16:30,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:30,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:16:30,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:33,493 INFO L124 PetriNetUnfolderBase]: 6047/9558 cut-off events. [2024-06-28 00:16:33,493 INFO L125 PetriNetUnfolderBase]: For 830594/830598 co-relation queries the response was YES. [2024-06-28 00:16:33,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78089 conditions, 9558 events. 6047/9558 cut-off events. For 830594/830598 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 62244 event pairs, 2216 based on Foata normal form. 18/9576 useless extension candidates. Maximal degree in co-relation 77909. Up to 9006 conditions per place. [2024-06-28 00:16:33,655 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 787 selfloop transitions, 90 changer transitions 0/880 dead transitions. [2024-06-28 00:16:33,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 880 transitions, 17073 flow [2024-06-28 00:16:33,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:16:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:16:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-28 00:16:33,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-28 00:16:33,656 INFO L175 Difference]: Start difference. First operand has 386 places, 848 transitions, 15013 flow. Second operand 9 states and 143 transitions. [2024-06-28 00:16:33,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 880 transitions, 17073 flow [2024-06-28 00:16:37,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 880 transitions, 16825 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-28 00:16:37,125 INFO L231 Difference]: Finished difference. Result has 391 places, 850 transitions, 15069 flow [2024-06-28 00:16:37,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14765, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15069, PETRI_PLACES=391, PETRI_TRANSITIONS=850} [2024-06-28 00:16:37,126 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 350 predicate places. [2024-06-28 00:16:37,126 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 850 transitions, 15069 flow [2024-06-28 00:16:37,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:16:37,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:37,126 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:16:37,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-28 00:16:37,126 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:37,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:37,127 INFO L85 PathProgramCache]: Analyzing trace with hash 741234686, now seen corresponding path program 8 times [2024-06-28 00:16:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441805527] [2024-06-28 00:16:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:39,202 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:16:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441805527] [2024-06-28 00:16:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441805527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:16:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364354625] [2024-06-28 00:16:39,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:39,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:16:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:39,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:16:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:16:39,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:16:39,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 850 transitions, 15069 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:16:39,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:39,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:16:39,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:42,461 INFO L124 PetriNetUnfolderBase]: 6115/9669 cut-off events. [2024-06-28 00:16:42,461 INFO L125 PetriNetUnfolderBase]: For 849304/849308 co-relation queries the response was YES. [2024-06-28 00:16:42,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78831 conditions, 9669 events. 6115/9669 cut-off events. For 849304/849308 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 63086 event pairs, 2226 based on Foata normal form. 18/9687 useless extension candidates. Maximal degree in co-relation 78650. Up to 8773 conditions per place. [2024-06-28 00:16:42,628 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 734 selfloop transitions, 147 changer transitions 0/884 dead transitions. [2024-06-28 00:16:42,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 884 transitions, 17177 flow [2024-06-28 00:16:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:16:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:16:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-28 00:16:42,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-28 00:16:42,630 INFO L175 Difference]: Start difference. First operand has 391 places, 850 transitions, 15069 flow. Second operand 9 states and 143 transitions. [2024-06-28 00:16:42,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 884 transitions, 17177 flow [2024-06-28 00:16:45,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 884 transitions, 16908 flow, removed 50 selfloop flow, removed 6 redundant places. [2024-06-28 00:16:45,491 INFO L231 Difference]: Finished difference. Result has 394 places, 852 transitions, 15230 flow [2024-06-28 00:16:45,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14800, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15230, PETRI_PLACES=394, PETRI_TRANSITIONS=852} [2024-06-28 00:16:45,492 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 353 predicate places. [2024-06-28 00:16:45,492 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 852 transitions, 15230 flow [2024-06-28 00:16:45,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:16:45,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:45,493 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:16:45,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-28 00:16:45,493 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:45,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash 913955216, now seen corresponding path program 9 times [2024-06-28 00:16:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:45,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837491403] [2024-06-28 00:16:45,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:45,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:47,501 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:16:47,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:47,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837491403] [2024-06-28 00:16:47,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837491403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:47,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:47,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:16:47,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300781574] [2024-06-28 00:16:47,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:47,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:16:47,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:47,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:16:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:16:47,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:16:47,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 852 transitions, 15230 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:16:47,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:47,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:16:47,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:50,885 INFO L124 PetriNetUnfolderBase]: 6183/9787 cut-off events. [2024-06-28 00:16:50,886 INFO L125 PetriNetUnfolderBase]: For 871141/871145 co-relation queries the response was YES. [2024-06-28 00:16:50,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79778 conditions, 9787 events. 6183/9787 cut-off events. For 871141/871145 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 64120 event pairs, 2246 based on Foata normal form. 18/9805 useless extension candidates. Maximal degree in co-relation 79596. Up to 8752 conditions per place. [2024-06-28 00:16:51,042 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 734 selfloop transitions, 151 changer transitions 0/888 dead transitions. [2024-06-28 00:16:51,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 888 transitions, 17366 flow [2024-06-28 00:16:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:16:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:16:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-28 00:16:51,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-28 00:16:51,043 INFO L175 Difference]: Start difference. First operand has 394 places, 852 transitions, 15230 flow. Second operand 9 states and 141 transitions. [2024-06-28 00:16:51,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 888 transitions, 17366 flow [2024-06-28 00:16:54,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 888 transitions, 16972 flow, removed 56 selfloop flow, removed 7 redundant places. [2024-06-28 00:16:54,051 INFO L231 Difference]: Finished difference. Result has 396 places, 854 transitions, 15276 flow [2024-06-28 00:16:54,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14840, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15276, PETRI_PLACES=396, PETRI_TRANSITIONS=854} [2024-06-28 00:16:54,052 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 355 predicate places. [2024-06-28 00:16:54,052 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 854 transitions, 15276 flow [2024-06-28 00:16:54,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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:16:54,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:54,052 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:16:54,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-28 00:16:54,052 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:54,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:54,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1755570128, now seen corresponding path program 10 times [2024-06-28 00:16:54,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:54,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668462531] [2024-06-28 00:16:54,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:55,983 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:16:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668462531] [2024-06-28 00:16:55,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668462531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861195093] [2024-06-28 00:16:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:55,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:55,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:55,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:55,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:56,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:16:56,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 854 transitions, 15276 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:16:56,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:56,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:16:56,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:59,036 INFO L124 PetriNetUnfolderBase]: 6150/9715 cut-off events. [2024-06-28 00:16:59,037 INFO L125 PetriNetUnfolderBase]: For 797231/797235 co-relation queries the response was YES. [2024-06-28 00:16:59,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77305 conditions, 9715 events. 6150/9715 cut-off events. For 797231/797235 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 63230 event pairs, 2275 based on Foata normal form. 18/9733 useless extension candidates. Maximal degree in co-relation 77122. Up to 9308 conditions per place. [2024-06-28 00:16:59,202 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 855 selfloop transitions, 23 changer transitions 0/881 dead transitions. [2024-06-28 00:16:59,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 881 transitions, 16984 flow [2024-06-28 00:16:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:16:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:16:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2024-06-28 00:16:59,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37222222222222223 [2024-06-28 00:16:59,203 INFO L175 Difference]: Start difference. First operand has 396 places, 854 transitions, 15276 flow. Second operand 9 states and 134 transitions. [2024-06-28 00:16:59,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 881 transitions, 16984 flow [2024-06-28 00:17:02,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 881 transitions, 16580 flow, removed 56 selfloop flow, removed 7 redundant places. [2024-06-28 00:17:02,346 INFO L231 Difference]: Finished difference. Result has 397 places, 853 transitions, 14764 flow [2024-06-28 00:17:02,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14712, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14764, PETRI_PLACES=397, PETRI_TRANSITIONS=853} [2024-06-28 00:17:02,347 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 356 predicate places. [2024-06-28 00:17:02,347 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 853 transitions, 14764 flow [2024-06-28 00:17:02,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:17:02,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:02,347 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:17:02,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-28 00:17:02,347 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:17:02,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash -954473170, now seen corresponding path program 6 times [2024-06-28 00:17:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:02,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767462047] [2024-06-28 00:17:02,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:02,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:04,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:17:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:04,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767462047] [2024-06-28 00:17:04,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767462047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:04,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:04,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:17:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059498489] [2024-06-28 00:17:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:04,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:17:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:17:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:17:04,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:17:04,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 853 transitions, 14764 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:17:04,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:04,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:17:04,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:07,517 INFO L124 PetriNetUnfolderBase]: 6172/9760 cut-off events. [2024-06-28 00:17:07,518 INFO L125 PetriNetUnfolderBase]: For 731371/731371 co-relation queries the response was YES. [2024-06-28 00:17:07,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76335 conditions, 9760 events. 6172/9760 cut-off events. For 731371/731371 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 63949 event pairs, 2315 based on Foata normal form. 4/9764 useless extension candidates. Maximal degree in co-relation 76151. Up to 9506 conditions per place. [2024-06-28 00:17:07,660 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 834 selfloop transitions, 41 changer transitions 0/878 dead transitions. [2024-06-28 00:17:07,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 878 transitions, 16736 flow [2024-06-28 00:17:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:17:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:17:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-28 00:17:07,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2024-06-28 00:17:07,661 INFO L175 Difference]: Start difference. First operand has 397 places, 853 transitions, 14764 flow. Second operand 9 states and 125 transitions. [2024-06-28 00:17:07,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 878 transitions, 16736 flow [2024-06-28 00:17:10,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 878 transitions, 16328 flow, removed 53 selfloop flow, removed 8 redundant places. [2024-06-28 00:17:10,578 INFO L231 Difference]: Finished difference. Result has 400 places, 867 transitions, 14690 flow [2024-06-28 00:17:10,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14356, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14690, PETRI_PLACES=400, PETRI_TRANSITIONS=867} [2024-06-28 00:17:10,579 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 359 predicate places. [2024-06-28 00:17:10,579 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 867 transitions, 14690 flow [2024-06-28 00:17:10,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:17:10,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:10,579 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:17:10,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-28 00:17:10,579 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:17:10,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2146391211, now seen corresponding path program 1 times [2024-06-28 00:17:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208031170] [2024-06-28 00:17:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:10,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:12,972 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:17:12,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:12,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208031170] [2024-06-28 00:17:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208031170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:12,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:12,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569271693] [2024-06-28 00:17:12,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:12,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:12,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:13,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:17:13,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 867 transitions, 14690 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:17:13,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:13,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:17:13,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:16,292 INFO L124 PetriNetUnfolderBase]: 6192/9789 cut-off events. [2024-06-28 00:17:16,293 INFO L125 PetriNetUnfolderBase]: For 737469/737473 co-relation queries the response was YES. [2024-06-28 00:17:16,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75564 conditions, 9789 events. 6192/9789 cut-off events. For 737469/737473 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 64166 event pairs, 2329 based on Foata normal form. 8/9797 useless extension candidates. Maximal degree in co-relation 75378. Up to 9452 conditions per place. [2024-06-28 00:17:16,427 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 851 selfloop transitions, 37 changer transitions 0/891 dead transitions. [2024-06-28 00:17:16,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 891 transitions, 16840 flow [2024-06-28 00:17:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:17:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:17:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-28 00:17:16,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-28 00:17:16,431 INFO L175 Difference]: Start difference. First operand has 400 places, 867 transitions, 14690 flow. Second operand 8 states and 121 transitions. [2024-06-28 00:17:16,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 891 transitions, 16840 flow [2024-06-28 00:17:19,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 891 transitions, 16710 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-28 00:17:19,058 INFO L231 Difference]: Finished difference. Result has 403 places, 873 transitions, 14746 flow [2024-06-28 00:17:19,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14560, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14746, PETRI_PLACES=403, PETRI_TRANSITIONS=873} [2024-06-28 00:17:19,061 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 362 predicate places. [2024-06-28 00:17:19,061 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 873 transitions, 14746 flow [2024-06-28 00:17:19,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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:17:19,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:19,061 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:17:19,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-28 00:17:19,062 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:17:19,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash -793782357, now seen corresponding path program 2 times [2024-06-28 00:17:19,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:19,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630081006] [2024-06-28 00:17:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:21,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:17:21,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:21,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630081006] [2024-06-28 00:17:21,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630081006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:21,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:21,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:17:21,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750170939] [2024-06-28 00:17:21,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:21,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:17:21,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:21,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:17:21,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:17:21,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:17:21,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 873 transitions, 14746 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:17:21,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:21,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:17:21,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:24,581 INFO L124 PetriNetUnfolderBase]: 6180/9773 cut-off events. [2024-06-28 00:17:24,582 INFO L125 PetriNetUnfolderBase]: For 738664/738668 co-relation queries the response was YES. [2024-06-28 00:17:24,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75670 conditions, 9773 events. 6180/9773 cut-off events. For 738664/738668 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 64047 event pairs, 2315 based on Foata normal form. 8/9781 useless extension candidates. Maximal degree in co-relation 75483. Up to 9486 conditions per place. [2024-06-28 00:17:24,738 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 854 selfloop transitions, 29 changer transitions 0/886 dead transitions. [2024-06-28 00:17:24,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 886 transitions, 16580 flow [2024-06-28 00:17:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:17:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:17:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2024-06-28 00:17:24,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-28 00:17:24,739 INFO L175 Difference]: Start difference. First operand has 403 places, 873 transitions, 14746 flow. Second operand 8 states and 115 transitions. [2024-06-28 00:17:24,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 886 transitions, 16580 flow [2024-06-28 00:17:27,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 886 transitions, 16477 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-06-28 00:17:27,830 INFO L231 Difference]: Finished difference. Result has 407 places, 873 transitions, 14707 flow [2024-06-28 00:17:27,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14643, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=844, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14707, PETRI_PLACES=407, PETRI_TRANSITIONS=873} [2024-06-28 00:17:27,831 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 366 predicate places. [2024-06-28 00:17:27,831 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 873 transitions, 14707 flow [2024-06-28 00:17:27,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:17:27,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:27,831 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:17:27,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-28 00:17:27,831 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:17:27,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash 832749456, now seen corresponding path program 1 times [2024-06-28 00:17:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890076846] [2024-06-28 00:17:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:29,876 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:17:29,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890076846] [2024-06-28 00:17:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890076846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:29,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:29,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:29,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23547127] [2024-06-28 00:17:29,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:29,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:29,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:29,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:29,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:29,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:17:29,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 873 transitions, 14707 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:17:29,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:29,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:17:29,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:33,178 INFO L124 PetriNetUnfolderBase]: 6217/9791 cut-off events. [2024-06-28 00:17:33,179 INFO L125 PetriNetUnfolderBase]: For 742166/742173 co-relation queries the response was YES. [2024-06-28 00:17:33,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76007 conditions, 9791 events. 6217/9791 cut-off events. For 742166/742173 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 63517 event pairs, 1757 based on Foata normal form. 8/9799 useless extension candidates. Maximal degree in co-relation 75819. Up to 9285 conditions per place. [2024-06-28 00:17:33,343 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 826 selfloop transitions, 92 changer transitions 0/921 dead transitions. [2024-06-28 00:17:33,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 921 transitions, 16988 flow [2024-06-28 00:17:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:17:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:17:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 00:17:33,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-28 00:17:33,344 INFO L175 Difference]: Start difference. First operand has 407 places, 873 transitions, 14707 flow. Second operand 9 states and 155 transitions. [2024-06-28 00:17:33,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 921 transitions, 16988 flow [2024-06-28 00:17:36,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 921 transitions, 16899 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 00:17:36,495 INFO L231 Difference]: Finished difference. Result has 411 places, 883 transitions, 14962 flow [2024-06-28 00:17:36,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14618, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14962, PETRI_PLACES=411, PETRI_TRANSITIONS=883} [2024-06-28 00:17:36,496 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 370 predicate places. [2024-06-28 00:17:36,496 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 883 transitions, 14962 flow [2024-06-28 00:17:36,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:17:36,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:36,496 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:17:36,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-28 00:17:36,496 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:36,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 50533080, now seen corresponding path program 2 times [2024-06-28 00:17:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:36,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957538895] [2024-06-28 00:17:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:38,604 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:17:38,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957538895] [2024-06-28 00:17:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957538895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:38,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:38,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:38,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989354862] [2024-06-28 00:17:38,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:38,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:38,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:38,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:17:38,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 883 transitions, 14962 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:17:38,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:38,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:17:38,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:42,020 INFO L124 PetriNetUnfolderBase]: 6257/9853 cut-off events. [2024-06-28 00:17:42,021 INFO L125 PetriNetUnfolderBase]: For 768538/768545 co-relation queries the response was YES. [2024-06-28 00:17:42,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77446 conditions, 9853 events. 6257/9853 cut-off events. For 768538/768545 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 64179 event pairs, 1932 based on Foata normal form. 8/9861 useless extension candidates. Maximal degree in co-relation 77256. Up to 9431 conditions per place. [2024-06-28 00:17:42,184 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 834 selfloop transitions, 91 changer transitions 0/928 dead transitions. [2024-06-28 00:17:42,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 928 transitions, 17269 flow [2024-06-28 00:17:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:17:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:17:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-28 00:17:42,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4361111111111111 [2024-06-28 00:17:42,185 INFO L175 Difference]: Start difference. First operand has 411 places, 883 transitions, 14962 flow. Second operand 9 states and 157 transitions. [2024-06-28 00:17:42,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 928 transitions, 17269 flow [2024-06-28 00:17:45,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 928 transitions, 17070 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-28 00:17:45,678 INFO L231 Difference]: Finished difference. Result has 417 places, 891 transitions, 15101 flow [2024-06-28 00:17:45,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14813, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=883, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15101, PETRI_PLACES=417, PETRI_TRANSITIONS=891} [2024-06-28 00:17:45,678 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 376 predicate places. [2024-06-28 00:17:45,678 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 891 transitions, 15101 flow [2024-06-28 00:17:45,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:17:45,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:45,678 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:17:45,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-28 00:17:45,679 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:45,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1674167626, now seen corresponding path program 1 times [2024-06-28 00:17:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:45,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329778200] [2024-06-28 00:17:45,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:45,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:48,341 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:17:48,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:48,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329778200] [2024-06-28 00:17:48,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329778200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:48,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:48,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381965837] [2024-06-28 00:17:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:48,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:48,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:17:48,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 891 transitions, 15101 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:17:48,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:48,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:17:48,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:51,781 INFO L124 PetriNetUnfolderBase]: 6267/9871 cut-off events. [2024-06-28 00:17:51,781 INFO L125 PetriNetUnfolderBase]: For 784157/784161 co-relation queries the response was YES. [2024-06-28 00:17:51,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77836 conditions, 9871 events. 6267/9871 cut-off events. For 784157/784161 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 64343 event pairs, 1946 based on Foata normal form. 6/9877 useless extension candidates. Maximal degree in co-relation 77643. Up to 9340 conditions per place. [2024-06-28 00:17:51,935 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 767 selfloop transitions, 161 changer transitions 0/931 dead transitions. [2024-06-28 00:17:51,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 931 transitions, 17406 flow [2024-06-28 00:17:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:17:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:17:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-28 00:17:51,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175 [2024-06-28 00:17:51,936 INFO L175 Difference]: Start difference. First operand has 417 places, 891 transitions, 15101 flow. Second operand 10 states and 167 transitions. [2024-06-28 00:17:51,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 931 transitions, 17406 flow [2024-06-28 00:17:55,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 931 transitions, 17293 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 00:17:55,076 INFO L231 Difference]: Finished difference. Result has 422 places, 897 transitions, 15438 flow [2024-06-28 00:17:55,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14988, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15438, PETRI_PLACES=422, PETRI_TRANSITIONS=897} [2024-06-28 00:17:55,077 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 381 predicate places. [2024-06-28 00:17:55,077 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 897 transitions, 15438 flow [2024-06-28 00:17:55,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:17:55,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:55,077 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:17:55,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-28 00:17:55,077 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:55,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash 70186770, now seen corresponding path program 3 times [2024-06-28 00:17:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:55,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402016862] [2024-06-28 00:17:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:57,797 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:17:57,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:57,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402016862] [2024-06-28 00:17:57,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402016862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:57,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:57,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23268762] [2024-06-28 00:17:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:57,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:57,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:57,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:17:57,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 897 transitions, 15438 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:17:57,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:57,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:17:57,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:01,152 INFO L124 PetriNetUnfolderBase]: 6262/9864 cut-off events. [2024-06-28 00:18:01,153 INFO L125 PetriNetUnfolderBase]: For 793633/793637 co-relation queries the response was YES. [2024-06-28 00:18:01,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78620 conditions, 9864 events. 6262/9864 cut-off events. For 793633/793637 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 64273 event pairs, 1943 based on Foata normal form. 6/9870 useless extension candidates. Maximal degree in co-relation 78424. Up to 9500 conditions per place. [2024-06-28 00:18:01,304 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 842 selfloop transitions, 84 changer transitions 0/929 dead transitions. [2024-06-28 00:18:01,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 929 transitions, 17427 flow [2024-06-28 00:18:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:18:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:18:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-28 00:18:01,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925 [2024-06-28 00:18:01,305 INFO L175 Difference]: Start difference. First operand has 422 places, 897 transitions, 15438 flow. Second operand 10 states and 157 transitions. [2024-06-28 00:18:01,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 929 transitions, 17427 flow [2024-06-28 00:18:04,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 929 transitions, 17113 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-28 00:18:04,233 INFO L231 Difference]: Finished difference. Result has 425 places, 897 transitions, 15297 flow [2024-06-28 00:18:04,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=15124, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15297, PETRI_PLACES=425, PETRI_TRANSITIONS=897} [2024-06-28 00:18:04,234 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 384 predicate places. [2024-06-28 00:18:04,234 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 897 transitions, 15297 flow [2024-06-28 00:18:04,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:18:04,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:04,235 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:18:04,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-28 00:18:04,235 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:04,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1893509808, now seen corresponding path program 1 times [2024-06-28 00:18:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:04,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326899004] [2024-06-28 00:18:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:06,443 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:18:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326899004] [2024-06-28 00:18:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326899004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:06,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:06,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:18:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230905854] [2024-06-28 00:18:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:06,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:18:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:06,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:18:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:18:06,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:18:06,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 897 transitions, 15297 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:18:06,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:06,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:18:06,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:10,126 INFO L124 PetriNetUnfolderBase]: 6432/10085 cut-off events. [2024-06-28 00:18:10,127 INFO L125 PetriNetUnfolderBase]: For 859261/859269 co-relation queries the response was YES. [2024-06-28 00:18:10,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80903 conditions, 10085 events. 6432/10085 cut-off events. For 859261/859269 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 65601 event pairs, 1741 based on Foata normal form. 11/10096 useless extension candidates. Maximal degree in co-relation 80707. Up to 9282 conditions per place. [2024-06-28 00:18:10,331 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 778 selfloop transitions, 187 changer transitions 0/968 dead transitions. [2024-06-28 00:18:10,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 968 transitions, 18507 flow [2024-06-28 00:18:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-28 00:18:10,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-28 00:18:10,332 INFO L175 Difference]: Start difference. First operand has 425 places, 897 transitions, 15297 flow. Second operand 9 states and 162 transitions. [2024-06-28 00:18:10,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 968 transitions, 18507 flow [2024-06-28 00:18:13,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 968 transitions, 18373 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 00:18:13,559 INFO L231 Difference]: Finished difference. Result has 427 places, 927 transitions, 16071 flow [2024-06-28 00:18:13,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=15165, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16071, PETRI_PLACES=427, PETRI_TRANSITIONS=927} [2024-06-28 00:18:13,559 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 386 predicate places. [2024-06-28 00:18:13,559 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 927 transitions, 16071 flow [2024-06-28 00:18:13,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:18:13,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:13,559 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:18:13,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-28 00:18:13,560 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:13,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash 403211056, now seen corresponding path program 2 times [2024-06-28 00:18:13,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:13,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894492158] [2024-06-28 00:18:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:15,417 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:18:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894492158] [2024-06-28 00:18:15,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894492158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:15,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:18:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467332241] [2024-06-28 00:18:15,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:15,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:18:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:15,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:18:15,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:18:15,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:18:15,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 927 transitions, 16071 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:18:15,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:15,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:18:15,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:18,874 INFO L124 PetriNetUnfolderBase]: 6427/10080 cut-off events. [2024-06-28 00:18:18,875 INFO L125 PetriNetUnfolderBase]: For 866363/866371 co-relation queries the response was YES. [2024-06-28 00:18:19,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81441 conditions, 10080 events. 6427/10080 cut-off events. For 866363/866371 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 65613 event pairs, 1720 based on Foata normal form. 11/10091 useless extension candidates. Maximal degree in co-relation 81244. Up to 9375 conditions per place. [2024-06-28 00:18:19,051 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 803 selfloop transitions, 199 changer transitions 0/1005 dead transitions. [2024-06-28 00:18:19,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 1005 transitions, 19508 flow [2024-06-28 00:18:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:18:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:18:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-28 00:18:19,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022727272727273 [2024-06-28 00:18:19,052 INFO L175 Difference]: Start difference. First operand has 427 places, 927 transitions, 16071 flow. Second operand 11 states and 177 transitions. [2024-06-28 00:18:19,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 1005 transitions, 19508 flow [2024-06-28 00:18:22,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 1005 transitions, 19135 flow, removed 145 selfloop flow, removed 4 redundant places. [2024-06-28 00:18:22,409 INFO L231 Difference]: Finished difference. Result has 438 places, 972 transitions, 17219 flow [2024-06-28 00:18:22,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=15824, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=751, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17219, PETRI_PLACES=438, PETRI_TRANSITIONS=972} [2024-06-28 00:18:22,410 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 397 predicate places. [2024-06-28 00:18:22,410 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 972 transitions, 17219 flow [2024-06-28 00:18:22,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:18:22,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:22,410 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:18:22,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-28 00:18:22,410 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:22,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash 383249350, now seen corresponding path program 4 times [2024-06-28 00:18:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:22,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77110846] [2024-06-28 00:18:22,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:22,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:24,604 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:18:24,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77110846] [2024-06-28 00:18:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77110846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206065752] [2024-06-28 00:18:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:24,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:24,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:24,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:24,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:18:24,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 972 transitions, 17219 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:18:24,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:24,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:18:24,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:28,173 INFO L124 PetriNetUnfolderBase]: 6435/10102 cut-off events. [2024-06-28 00:18:28,173 INFO L125 PetriNetUnfolderBase]: For 904740/904747 co-relation queries the response was YES. [2024-06-28 00:18:28,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82369 conditions, 10102 events. 6435/10102 cut-off events. For 904740/904747 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 65627 event pairs, 1787 based on Foata normal form. 8/10110 useless extension candidates. Maximal degree in co-relation 82167. Up to 9567 conditions per place. [2024-06-28 00:18:28,339 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 900 selfloop transitions, 104 changer transitions 0/1007 dead transitions. [2024-06-28 00:18:28,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 1007 transitions, 19590 flow [2024-06-28 00:18:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-28 00:18:28,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-28 00:18:28,341 INFO L175 Difference]: Start difference. First operand has 438 places, 972 transitions, 17219 flow. Second operand 9 states and 156 transitions. [2024-06-28 00:18:28,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 1007 transitions, 19590 flow [2024-06-28 00:18:31,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 1007 transitions, 19146 flow, removed 183 selfloop flow, removed 4 redundant places. [2024-06-28 00:18:31,766 INFO L231 Difference]: Finished difference. Result has 443 places, 974 transitions, 17022 flow [2024-06-28 00:18:31,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=16775, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=870, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17022, PETRI_PLACES=443, PETRI_TRANSITIONS=974} [2024-06-28 00:18:31,766 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 402 predicate places. [2024-06-28 00:18:31,766 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 974 transitions, 17022 flow [2024-06-28 00:18:31,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:18:31,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:31,766 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:18:31,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-28 00:18:31,767 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:31,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 145287770, now seen corresponding path program 2 times [2024-06-28 00:18:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:31,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941900812] [2024-06-28 00:18:31,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:34,806 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:18:34,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:34,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941900812] [2024-06-28 00:18:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941900812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190688289] [2024-06-28 00:18:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:34,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:34,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:34,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:34,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:18:34,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 974 transitions, 17022 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:18:34,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:34,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:18:34,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:38,308 INFO L124 PetriNetUnfolderBase]: 6445/10120 cut-off events. [2024-06-28 00:18:38,308 INFO L125 PetriNetUnfolderBase]: For 910840/910844 co-relation queries the response was YES. [2024-06-28 00:18:38,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82485 conditions, 10120 events. 6445/10120 cut-off events. For 910840/910844 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 66035 event pairs, 1961 based on Foata normal form. 6/10126 useless extension candidates. Maximal degree in co-relation 82281. Up to 9597 conditions per place. [2024-06-28 00:18:38,511 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 851 selfloop transitions, 153 changer transitions 0/1007 dead transitions. [2024-06-28 00:18:38,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 1007 transitions, 19421 flow [2024-06-28 00:18:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:18:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:18:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 00:18:38,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-28 00:18:38,513 INFO L175 Difference]: Start difference. First operand has 443 places, 974 transitions, 17022 flow. Second operand 8 states and 152 transitions. [2024-06-28 00:18:38,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 1007 transitions, 19421 flow [2024-06-28 00:18:41,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 1007 transitions, 19269 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-28 00:18:41,989 INFO L231 Difference]: Finished difference. Result has 445 places, 977 transitions, 17242 flow [2024-06-28 00:18:41,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=16874, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17242, PETRI_PLACES=445, PETRI_TRANSITIONS=977} [2024-06-28 00:18:41,990 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 404 predicate places. [2024-06-28 00:18:41,990 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 977 transitions, 17242 flow [2024-06-28 00:18:41,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:18:41,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:41,990 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:18:41,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-28 00:18:41,990 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:41,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash 145278160, now seen corresponding path program 5 times [2024-06-28 00:18:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309953013] [2024-06-28 00:18:41,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:44,350 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:18:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309953013] [2024-06-28 00:18:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309953013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3078138] [2024-06-28 00:18:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:44,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:44,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:44,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:44,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:18:44,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 977 transitions, 17242 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:18:44,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:44,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:18:44,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:47,657 INFO L124 PetriNetUnfolderBase]: 6453/10132 cut-off events. [2024-06-28 00:18:47,657 INFO L125 PetriNetUnfolderBase]: For 896124/896128 co-relation queries the response was YES. [2024-06-28 00:18:47,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82502 conditions, 10132 events. 6453/10132 cut-off events. For 896124/896128 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 66072 event pairs, 1965 based on Foata normal form. 6/10138 useless extension candidates. Maximal degree in co-relation 82299. Up to 9762 conditions per place. [2024-06-28 00:18:47,833 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 918 selfloop transitions, 86 changer transitions 0/1007 dead transitions. [2024-06-28 00:18:47,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 1007 transitions, 19399 flow [2024-06-28 00:18:47,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-28 00:18:47,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-28 00:18:47,835 INFO L175 Difference]: Start difference. First operand has 445 places, 977 transitions, 17242 flow. Second operand 9 states and 151 transitions. [2024-06-28 00:18:47,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 1007 transitions, 19399 flow [2024-06-28 00:18:51,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 1007 transitions, 19122 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-28 00:18:51,363 INFO L231 Difference]: Finished difference. Result has 448 places, 979 transitions, 17173 flow [2024-06-28 00:18:51,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=16965, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=891, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17173, PETRI_PLACES=448, PETRI_TRANSITIONS=979} [2024-06-28 00:18:51,364 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 407 predicate places. [2024-06-28 00:18:51,364 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 979 transitions, 17173 flow [2024-06-28 00:18:51,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:18:51,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:51,364 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:18:51,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-28 00:18:51,364 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:51,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash 403575740, now seen corresponding path program 3 times [2024-06-28 00:18:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:51,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108616571] [2024-06-28 00:18:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:54,061 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:18:54,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108616571] [2024-06-28 00:18:54,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108616571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:54,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446212948] [2024-06-28 00:18:54,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:54,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:54,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:54,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:54,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:54,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:18:54,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 979 transitions, 17173 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:18:54,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:54,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:18:54,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:57,632 INFO L124 PetriNetUnfolderBase]: 6463/10145 cut-off events. [2024-06-28 00:18:57,632 INFO L125 PetriNetUnfolderBase]: For 896293/896295 co-relation queries the response was YES. [2024-06-28 00:18:57,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82483 conditions, 10145 events. 6463/10145 cut-off events. For 896293/896295 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 66173 event pairs, 1982 based on Foata normal form. 4/10149 useless extension candidates. Maximal degree in co-relation 82279. Up to 9737 conditions per place. [2024-06-28 00:18:57,806 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 879 selfloop transitions, 125 changer transitions 0/1007 dead transitions. [2024-06-28 00:18:57,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 1007 transitions, 19365 flow [2024-06-28 00:18:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 00:18:57,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2024-06-28 00:18:57,807 INFO L175 Difference]: Start difference. First operand has 448 places, 979 transitions, 17173 flow. Second operand 9 states and 154 transitions. [2024-06-28 00:18:57,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 1007 transitions, 19365 flow [2024-06-28 00:19:01,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 1007 transitions, 19222 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 00:19:01,551 INFO L231 Difference]: Finished difference. Result has 450 places, 982 transitions, 17350 flow [2024-06-28 00:19:01,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17032, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=979, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17350, PETRI_PLACES=450, PETRI_TRANSITIONS=982} [2024-06-28 00:19:01,552 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 409 predicate places. [2024-06-28 00:19:01,552 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 982 transitions, 17350 flow [2024-06-28 00:19:01,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:19:01,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:01,552 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:19:01,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-28 00:19:01,553 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:01,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:01,553 INFO L85 PathProgramCache]: Analyzing trace with hash 403566130, now seen corresponding path program 6 times [2024-06-28 00:19:01,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:01,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253945294] [2024-06-28 00:19:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:03,976 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:19:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253945294] [2024-06-28 00:19:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253945294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:03,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:03,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:19:03,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817939213] [2024-06-28 00:19:03,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:03,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:19:03,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:03,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:19:03,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:19:04,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:19:04,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 982 transitions, 17350 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:19:04,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:04,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:19:04,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:07,502 INFO L124 PetriNetUnfolderBase]: 6507/10213 cut-off events. [2024-06-28 00:19:07,502 INFO L125 PetriNetUnfolderBase]: For 944649/944651 co-relation queries the response was YES. [2024-06-28 00:19:07,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82980 conditions, 10213 events. 6507/10213 cut-off events. For 944649/944651 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 66693 event pairs, 1987 based on Foata normal form. 14/10227 useless extension candidates. Maximal degree in co-relation 82776. Up to 9757 conditions per place. [2024-06-28 00:19:07,682 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 887 selfloop transitions, 124 changer transitions 0/1014 dead transitions. [2024-06-28 00:19:07,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1014 transitions, 19585 flow [2024-06-28 00:19:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:19:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:19:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 00:19:07,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-06-28 00:19:07,683 INFO L175 Difference]: Start difference. First operand has 450 places, 982 transitions, 17350 flow. Second operand 8 states and 149 transitions. [2024-06-28 00:19:07,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1014 transitions, 19585 flow [2024-06-28 00:19:11,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 1014 transitions, 19300 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-28 00:19:11,194 INFO L231 Difference]: Finished difference. Result has 451 places, 985 transitions, 17374 flow [2024-06-28 00:19:11,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17065, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=858, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17374, PETRI_PLACES=451, PETRI_TRANSITIONS=985} [2024-06-28 00:19:11,194 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 410 predicate places. [2024-06-28 00:19:11,194 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 985 transitions, 17374 flow [2024-06-28 00:19:11,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:19:11,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:11,195 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:19:11,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-28 00:19:11,195 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:11,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash 513250266, now seen corresponding path program 3 times [2024-06-28 00:19:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:11,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565146664] [2024-06-28 00:19:11,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:11,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:13,271 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:19:13,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:13,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565146664] [2024-06-28 00:19:13,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565146664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:13,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:13,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641591697] [2024-06-28 00:19:13,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:13,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:13,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:13,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:19:13,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 985 transitions, 17374 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:19:13,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:13,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:19:13,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:17,277 INFO L124 PetriNetUnfolderBase]: 6550/10261 cut-off events. [2024-06-28 00:19:17,277 INFO L125 PetriNetUnfolderBase]: For 936577/936585 co-relation queries the response was YES. [2024-06-28 00:19:17,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83943 conditions, 10261 events. 6550/10261 cut-off events. For 936577/936585 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 66889 event pairs, 1732 based on Foata normal form. 14/10275 useless extension candidates. Maximal degree in co-relation 83739. Up to 9440 conditions per place. [2024-06-28 00:19:17,454 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 761 selfloop transitions, 277 changer transitions 0/1041 dead transitions. [2024-06-28 00:19:17,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 1041 transitions, 20841 flow [2024-06-28 00:19:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:19:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:19:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2024-06-28 00:19:17,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38958333333333334 [2024-06-28 00:19:17,456 INFO L175 Difference]: Start difference. First operand has 451 places, 985 transitions, 17374 flow. Second operand 12 states and 187 transitions. [2024-06-28 00:19:17,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 1041 transitions, 20841 flow [2024-06-28 00:19:21,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 1041 transitions, 20588 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-28 00:19:21,258 INFO L231 Difference]: Finished difference. Result has 458 places, 1004 transitions, 18118 flow [2024-06-28 00:19:21,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17095, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=18118, PETRI_PLACES=458, PETRI_TRANSITIONS=1004} [2024-06-28 00:19:21,259 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 417 predicate places. [2024-06-28 00:19:21,259 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 1004 transitions, 18118 flow [2024-06-28 00:19:21,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:19:21,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:21,259 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:19:21,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-28 00:19:21,260 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:21,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:21,260 INFO L85 PathProgramCache]: Analyzing trace with hash 513457656, now seen corresponding path program 4 times [2024-06-28 00:19:21,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:21,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756966631] [2024-06-28 00:19:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:21,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:23,239 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:19:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756966631] [2024-06-28 00:19:23,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756966631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:23,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:23,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972512438] [2024-06-28 00:19:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:23,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:23,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:19:23,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 1004 transitions, 18118 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:19:23,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:23,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:19:23,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:27,595 INFO L124 PetriNetUnfolderBase]: 6642/10389 cut-off events. [2024-06-28 00:19:27,595 INFO L125 PetriNetUnfolderBase]: For 978907/978915 co-relation queries the response was YES. [2024-06-28 00:19:27,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86396 conditions, 10389 events. 6642/10389 cut-off events. For 978907/978915 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 67670 event pairs, 1726 based on Foata normal form. 11/10400 useless extension candidates. Maximal degree in co-relation 86189. Up to 9529 conditions per place. [2024-06-28 00:19:27,763 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 755 selfloop transitions, 318 changer transitions 0/1076 dead transitions. [2024-06-28 00:19:27,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 1076 transitions, 22043 flow [2024-06-28 00:19:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:19:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:19:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2024-06-28 00:19:27,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38958333333333334 [2024-06-28 00:19:27,764 INFO L175 Difference]: Start difference. First operand has 458 places, 1004 transitions, 18118 flow. Second operand 12 states and 187 transitions. [2024-06-28 00:19:27,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 1076 transitions, 22043 flow [2024-06-28 00:19:31,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 1076 transitions, 21184 flow, removed 218 selfloop flow, removed 6 redundant places. [2024-06-28 00:19:31,538 INFO L231 Difference]: Finished difference. Result has 467 places, 1045 transitions, 19270 flow [2024-06-28 00:19:31,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17448, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=19270, PETRI_PLACES=467, PETRI_TRANSITIONS=1045} [2024-06-28 00:19:31,539 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 426 predicate places. [2024-06-28 00:19:31,539 INFO L495 AbstractCegarLoop]: Abstraction has has 467 places, 1045 transitions, 19270 flow [2024-06-28 00:19:31,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:19:31,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:31,539 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:19:31,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-28 00:19:31,539 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:31,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1201583444, now seen corresponding path program 1 times [2024-06-28 00:19:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:31,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304310386] [2024-06-28 00:19:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:31,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:33,864 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:19:33,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:33,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304310386] [2024-06-28 00:19:33,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304310386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:33,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:33,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943011729] [2024-06-28 00:19:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:33,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:33,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:19:33,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 1045 transitions, 19270 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:19:33,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:33,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:19:33,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:38,111 INFO L124 PetriNetUnfolderBase]: 6678/10456 cut-off events. [2024-06-28 00:19:38,111 INFO L125 PetriNetUnfolderBase]: For 1056601/1056607 co-relation queries the response was YES. [2024-06-28 00:19:38,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87213 conditions, 10456 events. 6678/10456 cut-off events. For 1056601/1056607 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 68415 event pairs, 2016 based on Foata normal form. 4/10460 useless extension candidates. Maximal degree in co-relation 87004. Up to 9935 conditions per place. [2024-06-28 00:19:38,291 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 995 selfloop transitions, 115 changer transitions 0/1113 dead transitions. [2024-06-28 00:19:38,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 1113 transitions, 22960 flow [2024-06-28 00:19:38,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:19:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:19:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-06-28 00:19:38,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2024-06-28 00:19:38,292 INFO L175 Difference]: Start difference. First operand has 467 places, 1045 transitions, 19270 flow. Second operand 11 states and 178 transitions. [2024-06-28 00:19:38,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 1113 transitions, 22960 flow [2024-06-28 00:19:42,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 1113 transitions, 22052 flow, removed 292 selfloop flow, removed 5 redundant places. [2024-06-28 00:19:42,818 INFO L231 Difference]: Finished difference. Result has 478 places, 1077 transitions, 19589 flow [2024-06-28 00:19:42,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=18377, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=948, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19589, PETRI_PLACES=478, PETRI_TRANSITIONS=1077} [2024-06-28 00:19:42,818 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 437 predicate places. [2024-06-28 00:19:42,818 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 1077 transitions, 19589 flow [2024-06-28 00:19:42,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:19:42,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:42,818 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:19:42,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-28 00:19:42,819 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:42,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:42,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1907800942, now seen corresponding path program 5 times [2024-06-28 00:19:42,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:42,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986198813] [2024-06-28 00:19:42,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:42,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:44,679 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:19:44,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:44,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986198813] [2024-06-28 00:19:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986198813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:44,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:44,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372729909] [2024-06-28 00:19:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:44,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:44,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:44,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:44,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:44,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:19:44,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1077 transitions, 19589 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:19:44,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:44,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:19:44,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:48,826 INFO L124 PetriNetUnfolderBase]: 6656/10424 cut-off events. [2024-06-28 00:19:48,827 INFO L125 PetriNetUnfolderBase]: For 1096987/1096993 co-relation queries the response was YES. [2024-06-28 00:19:48,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87237 conditions, 10424 events. 6656/10424 cut-off events. For 1096987/1096993 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 68166 event pairs, 1993 based on Foata normal form. 12/10436 useless extension candidates. Maximal degree in co-relation 87022. Up to 9945 conditions per place. [2024-06-28 00:19:48,996 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 955 selfloop transitions, 145 changer transitions 0/1103 dead transitions. [2024-06-28 00:19:48,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 1103 transitions, 22118 flow [2024-06-28 00:19:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:19:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:19:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-28 00:19:48,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.395 [2024-06-28 00:19:48,997 INFO L175 Difference]: Start difference. First operand has 478 places, 1077 transitions, 19589 flow. Second operand 10 states and 158 transitions. [2024-06-28 00:19:48,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 1103 transitions, 22118 flow [2024-06-28 00:19:53,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 1103 transitions, 21305 flow, removed 356 selfloop flow, removed 6 redundant places. [2024-06-28 00:19:53,946 INFO L231 Difference]: Finished difference. Result has 482 places, 1070 transitions, 18971 flow [2024-06-28 00:19:53,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=18646, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1069, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18971, PETRI_PLACES=482, PETRI_TRANSITIONS=1070} [2024-06-28 00:19:53,946 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 441 predicate places. [2024-06-28 00:19:53,946 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 1070 transitions, 18971 flow [2024-06-28 00:19:53,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:19:53,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:53,947 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:19:53,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-28 00:19:53,947 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:53,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash 794036052, now seen corresponding path program 2 times [2024-06-28 00:19:53,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:53,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910083918] [2024-06-28 00:19:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:53,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:56,130 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:19:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910083918] [2024-06-28 00:19:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910083918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:56,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:56,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:19:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409733807] [2024-06-28 00:19:56,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:56,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:19:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:19:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:19:56,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:19:56,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 1070 transitions, 18971 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:19:56,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:56,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:19:56,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:00,233 INFO L124 PetriNetUnfolderBase]: 6776/10589 cut-off events. [2024-06-28 00:20:00,234 INFO L125 PetriNetUnfolderBase]: For 1042776/1042782 co-relation queries the response was YES. [2024-06-28 00:20:00,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87903 conditions, 10589 events. 6776/10589 cut-off events. For 1042776/1042782 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 69196 event pairs, 2002 based on Foata normal form. 12/10601 useless extension candidates. Maximal degree in co-relation 87690. Up to 10146 conditions per place. [2024-06-28 00:20:00,408 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 1018 selfloop transitions, 134 changer transitions 0/1155 dead transitions. [2024-06-28 00:20:00,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 1155 transitions, 22401 flow [2024-06-28 00:20:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:20:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:20:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-28 00:20:00,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-28 00:20:00,409 INFO L175 Difference]: Start difference. First operand has 482 places, 1070 transitions, 18971 flow. Second operand 9 states and 152 transitions. [2024-06-28 00:20:00,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 1155 transitions, 22401 flow [2024-06-28 00:20:04,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 1155 transitions, 21904 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-28 00:20:04,542 INFO L231 Difference]: Finished difference. Result has 484 places, 1119 transitions, 19744 flow [2024-06-28 00:20:04,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=18610, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1070, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19744, PETRI_PLACES=484, PETRI_TRANSITIONS=1119} [2024-06-28 00:20:04,542 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 443 predicate places. [2024-06-28 00:20:04,542 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 1119 transitions, 19744 flow [2024-06-28 00:20:04,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:20:04,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:04,543 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:20:04,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-28 00:20:04,543 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:04,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1324882608, now seen corresponding path program 6 times [2024-06-28 00:20:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:04,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126357810] [2024-06-28 00:20:04,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:04,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:06,950 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:20:06,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:06,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126357810] [2024-06-28 00:20:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126357810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:06,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:06,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:20:06,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073987082] [2024-06-28 00:20:06,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:06,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:20:06,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:20:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:20:07,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:20:07,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 1119 transitions, 19744 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:20:07,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:07,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:20:07,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:11,817 INFO L124 PetriNetUnfolderBase]: 6862/10709 cut-off events. [2024-06-28 00:20:11,817 INFO L125 PetriNetUnfolderBase]: For 1054553/1054559 co-relation queries the response was YES. [2024-06-28 00:20:11,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89616 conditions, 10709 events. 6862/10709 cut-off events. For 1054553/1054559 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 70025 event pairs, 1985 based on Foata normal form. 9/10718 useless extension candidates. Maximal degree in co-relation 89401. Up to 10218 conditions per place. [2024-06-28 00:20:11,995 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 1027 selfloop transitions, 167 changer transitions 0/1197 dead transitions. [2024-06-28 00:20:11,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 1197 transitions, 23102 flow [2024-06-28 00:20:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 00:20:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 00:20:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 212 transitions. [2024-06-28 00:20:11,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2024-06-28 00:20:11,996 INFO L175 Difference]: Start difference. First operand has 484 places, 1119 transitions, 19744 flow. Second operand 14 states and 212 transitions. [2024-06-28 00:20:11,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 1197 transitions, 23102 flow [2024-06-28 00:20:16,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 1197 transitions, 22816 flow, removed 39 selfloop flow, removed 4 redundant places. [2024-06-28 00:20:16,157 INFO L231 Difference]: Finished difference. Result has 496 places, 1152 transitions, 20385 flow [2024-06-28 00:20:16,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=19458, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=967, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=20385, PETRI_PLACES=496, PETRI_TRANSITIONS=1152} [2024-06-28 00:20:16,157 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 455 predicate places. [2024-06-28 00:20:16,157 INFO L495 AbstractCegarLoop]: Abstraction has has 496 places, 1152 transitions, 20385 flow [2024-06-28 00:20:16,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:20:16,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:16,157 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:20:16,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-28 00:20:16,158 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:16,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2028602504, now seen corresponding path program 7 times [2024-06-28 00:20:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:16,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492132566] [2024-06-28 00:20:16,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:18,471 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:20:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492132566] [2024-06-28 00:20:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492132566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:18,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:20:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531892604] [2024-06-28 00:20:18,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:18,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:20:18,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:18,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:20:18,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:20:18,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:20:18,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 1152 transitions, 20385 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:20:18,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:18,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:20:18,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:23,112 INFO L124 PetriNetUnfolderBase]: 6877/10721 cut-off events. [2024-06-28 00:20:23,112 INFO L125 PetriNetUnfolderBase]: For 1074212/1074218 co-relation queries the response was YES. [2024-06-28 00:20:23,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90171 conditions, 10721 events. 6877/10721 cut-off events. For 1074212/1074218 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 69914 event pairs, 1728 based on Foata normal form. 9/10730 useless extension candidates. Maximal degree in co-relation 89953. Up to 9737 conditions per place. [2024-06-28 00:20:23,293 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 805 selfloop transitions, 383 changer transitions 0/1191 dead transitions. [2024-06-28 00:20:23,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 1191 transitions, 23494 flow [2024-06-28 00:20:23,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:20:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:20:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 184 transitions. [2024-06-28 00:20:23,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-28 00:20:23,294 INFO L175 Difference]: Start difference. First operand has 496 places, 1152 transitions, 20385 flow. Second operand 12 states and 184 transitions. [2024-06-28 00:20:23,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 1191 transitions, 23494 flow [2024-06-28 00:20:28,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 1191 transitions, 23374 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-28 00:20:28,175 INFO L231 Difference]: Finished difference. Result has 503 places, 1162 transitions, 21192 flow [2024-06-28 00:20:28,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=20265, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=373, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=21192, PETRI_PLACES=503, PETRI_TRANSITIONS=1162} [2024-06-28 00:20:28,176 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 462 predicate places. [2024-06-28 00:20:28,176 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 1162 transitions, 21192 flow [2024-06-28 00:20:28,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:20:28,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:28,176 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:20:28,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-28 00:20:28,176 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:28,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:28,177 INFO L85 PathProgramCache]: Analyzing trace with hash 627975252, now seen corresponding path program 3 times [2024-06-28 00:20:28,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:28,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639123828] [2024-06-28 00:20:28,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:28,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:30,433 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:20:30,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:30,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639123828] [2024-06-28 00:20:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639123828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:30,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:30,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:20:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100908146] [2024-06-28 00:20:30,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:30,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:20:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:30,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:20:30,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:20:30,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:20:30,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 1162 transitions, 21192 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:20:30,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:30,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:20:30,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:34,584 INFO L124 PetriNetUnfolderBase]: 6975/10867 cut-off events. [2024-06-28 00:20:34,584 INFO L125 PetriNetUnfolderBase]: For 1149344/1149350 co-relation queries the response was YES. [2024-06-28 00:20:34,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93011 conditions, 10867 events. 6975/10867 cut-off events. For 1149344/1149350 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 71130 event pairs, 1988 based on Foata normal form. 12/10879 useless extension candidates. Maximal degree in co-relation 92791. Up to 10349 conditions per place. [2024-06-28 00:20:34,810 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 1058 selfloop transitions, 159 changer transitions 0/1220 dead transitions. [2024-06-28 00:20:34,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 1220 transitions, 24385 flow [2024-06-28 00:20:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:20:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:20:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2024-06-28 00:20:34,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025 [2024-06-28 00:20:34,811 INFO L175 Difference]: Start difference. First operand has 503 places, 1162 transitions, 21192 flow. Second operand 10 states and 161 transitions. [2024-06-28 00:20:34,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 1220 transitions, 24385 flow [2024-06-28 00:20:39,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 1220 transitions, 23888 flow, removed 84 selfloop flow, removed 5 redundant places. [2024-06-28 00:20:39,451 INFO L231 Difference]: Finished difference. Result has 509 places, 1185 transitions, 21413 flow [2024-06-28 00:20:39,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=20695, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=21413, PETRI_PLACES=509, PETRI_TRANSITIONS=1185} [2024-06-28 00:20:39,451 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 468 predicate places. [2024-06-28 00:20:39,451 INFO L495 AbstractCegarLoop]: Abstraction has has 509 places, 1185 transitions, 21413 flow [2024-06-28 00:20:39,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:20:39,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:39,452 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:20:39,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-28 00:20:39,452 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:39,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1656960902, now seen corresponding path program 8 times [2024-06-28 00:20:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:39,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611049030] [2024-06-28 00:20:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:41,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:20:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:41,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611049030] [2024-06-28 00:20:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611049030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:41,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:20:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532133165] [2024-06-28 00:20:41,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:41,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:20:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:41,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:20:41,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:20:41,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:20:41,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 1185 transitions, 21413 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:20:41,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:41,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:20:41,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:46,026 INFO L124 PetriNetUnfolderBase]: 6964/10852 cut-off events. [2024-06-28 00:20:46,026 INFO L125 PetriNetUnfolderBase]: For 1142820/1142826 co-relation queries the response was YES. [2024-06-28 00:20:46,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92738 conditions, 10852 events. 6964/10852 cut-off events. For 1142820/1142826 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 71060 event pairs, 1995 based on Foata normal form. 9/10861 useless extension candidates. Maximal degree in co-relation 92517. Up to 10434 conditions per place. [2024-06-28 00:20:46,210 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 1072 selfloop transitions, 134 changer transitions 0/1209 dead transitions. [2024-06-28 00:20:46,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 1209 transitions, 23903 flow [2024-06-28 00:20:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:20:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:20:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2024-06-28 00:20:46,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-28 00:20:46,211 INFO L175 Difference]: Start difference. First operand has 509 places, 1185 transitions, 21413 flow. Second operand 11 states and 165 transitions. [2024-06-28 00:20:46,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 1209 transitions, 23903 flow [2024-06-28 00:20:51,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 1209 transitions, 23716 flow, removed 77 selfloop flow, removed 3 redundant places. [2024-06-28 00:20:51,358 INFO L231 Difference]: Finished difference. Result has 517 places, 1181 transitions, 21447 flow [2024-06-28 00:20:51,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21161, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21447, PETRI_PLACES=517, PETRI_TRANSITIONS=1181} [2024-06-28 00:20:51,359 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 476 predicate places. [2024-06-28 00:20:51,359 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 1181 transitions, 21447 flow [2024-06-28 00:20:51,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:20:51,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:51,359 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:20:51,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-28 00:20:51,359 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:51,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1656837956, now seen corresponding path program 7 times [2024-06-28 00:20:51,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:51,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062393790] [2024-06-28 00:20:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:51,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:53,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:20:53,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:53,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062393790] [2024-06-28 00:20:53,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062393790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:53,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:53,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:20:53,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560123850] [2024-06-28 00:20:53,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:53,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:20:53,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:53,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:20:53,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:20:53,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:20:53,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 1181 transitions, 21447 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:20:53,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:53,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:20:53,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:58,011 INFO L124 PetriNetUnfolderBase]: 7008/10914 cut-off events. [2024-06-28 00:20:58,011 INFO L125 PetriNetUnfolderBase]: For 1219436/1219438 co-relation queries the response was YES. [2024-06-28 00:20:58,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93378 conditions, 10914 events. 7008/10914 cut-off events. For 1219436/1219438 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 71278 event pairs, 1774 based on Foata normal form. 14/10928 useless extension candidates. Maximal degree in co-relation 93155. Up to 10476 conditions per place. [2024-06-28 00:20:58,197 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 1084 selfloop transitions, 121 changer transitions 0/1208 dead transitions. [2024-06-28 00:20:58,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 1208 transitions, 24065 flow [2024-06-28 00:20:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:20:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:20:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-28 00:20:58,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-28 00:20:58,198 INFO L175 Difference]: Start difference. First operand has 517 places, 1181 transitions, 21447 flow. Second operand 9 states and 152 transitions. [2024-06-28 00:20:58,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 1208 transitions, 24065 flow [2024-06-28 00:21:02,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 1208 transitions, 23742 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-28 00:21:02,840 INFO L231 Difference]: Finished difference. Result has 515 places, 1184 transitions, 21432 flow [2024-06-28 00:21:02,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21126, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21432, PETRI_PLACES=515, PETRI_TRANSITIONS=1184} [2024-06-28 00:21:02,841 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 474 predicate places. [2024-06-28 00:21:02,841 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 1184 transitions, 21432 flow [2024-06-28 00:21:02,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:21:02,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:02,841 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:21:02,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-28 00:21:02,841 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:02,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash -87525740, now seen corresponding path program 4 times [2024-06-28 00:21:02,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:02,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179698171] [2024-06-28 00:21:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:05,614 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:21:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179698171] [2024-06-28 00:21:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179698171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:05,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:05,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:21:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923108307] [2024-06-28 00:21:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:05,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:21:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:05,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:21:05,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:21:05,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:21:05,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 1184 transitions, 21432 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:21:05,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:05,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:21:05,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:09,735 INFO L124 PetriNetUnfolderBase]: 7018/10928 cut-off events. [2024-06-28 00:21:09,735 INFO L125 PetriNetUnfolderBase]: For 1179569/1179571 co-relation queries the response was YES. [2024-06-28 00:21:09,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93700 conditions, 10928 events. 7018/10928 cut-off events. For 1179569/1179571 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 71378 event pairs, 1767 based on Foata normal form. 4/10932 useless extension candidates. Maximal degree in co-relation 93476. Up to 10532 conditions per place. [2024-06-28 00:21:09,937 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 1083 selfloop transitions, 121 changer transitions 0/1207 dead transitions. [2024-06-28 00:21:09,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 1207 transitions, 24011 flow [2024-06-28 00:21:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:21:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:21:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-28 00:21:09,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-28 00:21:09,938 INFO L175 Difference]: Start difference. First operand has 515 places, 1184 transitions, 21432 flow. Second operand 9 states and 149 transitions. [2024-06-28 00:21:09,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 1207 transitions, 24011 flow [2024-06-28 00:21:14,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 1207 transitions, 23755 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-28 00:21:14,890 INFO L231 Difference]: Finished difference. Result has 517 places, 1187 transitions, 21491 flow [2024-06-28 00:21:14,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21176, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1063, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21491, PETRI_PLACES=517, PETRI_TRANSITIONS=1187} [2024-06-28 00:21:14,890 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 476 predicate places. [2024-06-28 00:21:14,891 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 1187 transitions, 21491 flow [2024-06-28 00:21:14,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:21:14,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:14,891 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:21:14,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-28 00:21:14,891 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:14,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash 800711406, now seen corresponding path program 1 times [2024-06-28 00:21:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230912671] [2024-06-28 00:21:14,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:18,750 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:21:18,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:18,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230912671] [2024-06-28 00:21:18,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230912671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:18,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:18,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:21:18,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663516986] [2024-06-28 00:21:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:18,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:21:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:18,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:21:18,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:21:18,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-28 00:21:18,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 1187 transitions, 21491 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:21:18,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:18,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-28 00:21:18,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:20,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L773-->L776: Formula: (= v_~y~0_3 1) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0][167], [Black: 1020#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 312#true, Black: 520#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 1547#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd3~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EBX~0 1)) (= |#ghost~multithreaded| 0))), Black: 532#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$w_buff0_used~0 ~y$r_buff1_thd1~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0)) (= |#ghost~multithreaded| 0)), Black: 1039#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p2_EBX~0 0)), 1565#true, Black: 1038#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 1559#(and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff0_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= 0 ~y$r_buff0_thd3~0) (= 2 ~y$w_buff0~0)), Black: 1555#(and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff0_used~0 0) (<= 0 ~y$r_buff0_thd3~0) (= 2 ~y$w_buff0~0)), 272#true, Black: 544#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (+ ~y$r_buff1_thd3~0 ~y$r_buff0_thd3~0)) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1058#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1572#(and (or (and (= ~y$w_buff1~0 0) (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1577#(and (= ~y$flush_delayed~0 0) (or (and (= ~y$w_buff1~0 0) (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (or (and (<= (+ 2 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 ~y$mem_tmp~0)) (= 2 ~__unbuffered_p2_EAX~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~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)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 55#(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) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1075#(and (= (div ~y$w_buff0_used~0 256) 0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 60#(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) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 575#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 1092#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)), Black: 589#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd1~0) (+ ~y$r_buff1_thd3~0 1)) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0))), Black: 86#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))), Black: 1105#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), 1206#true, Black: 1629#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$r_buff1_thd3~0 256))), 1879#true, 358#true, Black: 95#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))))) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 598#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)), Black: 613#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~x~0 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)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 1)), Black: 1122#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 623#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1138#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1664#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 2) (= 2 ~__unbuffered_p2_EAX~0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1152#(and (or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1153#(and (or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 636#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 635#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1676#(and (= 2 ~y$w_buff0~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$mem_tmp~0 2)) (= |#ghost~multithreaded| 0))), 1030#true, Black: 140#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~y~0 0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1167#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 656#(or (and (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1686#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$mem_tmp~0 2) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1182#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 673#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1704#(and (or (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 0) (= 2 ~y~0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$mem_tmp~0 2)) (= |#ghost~multithreaded| 0))), 100#true, 1158#true, Black: 171#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 170#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 172#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 1196#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1202#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1195#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1714#(and (= 2 ~y$w_buff0~0) (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 690#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 512#true, Black: 182#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), Black: 183#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), Black: 184#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), 1948#true, 1300#true, Black: 1214#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0)), 33#L851-5true, Black: 704#(or (and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 1 ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 702#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 703#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 1 ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 194#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 196#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 1735#(and (or (and (= ~y$flush_delayed~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1_used~0 0) (= ~x~0 1)) (= |#ghost~multithreaded| 0))), Black: 1227#(or (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) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), 817#(or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))) (= |#ghost~multithreaded| 0)), Black: 209#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 720#(and (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1)), Black: 1761#(and (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1242#(or (and (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= (div ~y$r_buff0_thd1~0 256) 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0)) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff0_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)), Black: 1759#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 221#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1757#(and (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~x~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), Black: 736#(or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 1745#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 149#true, Black: 235#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= 2 ~y$w_buff0~0)), Black: 750#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~__unbuffered_p2_EBX~0 0) (<= (+ ~y$r_buff1_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= ~y$r_buff0_thd1~0 1) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256))), Black: 1257#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= 2 ~y~0)), Black: 1255#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0)), Black: 1256#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0)), Black: 1254#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1783#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0))), Black: 1785#(and (or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0))), Black: 1770#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1779#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 762#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 247#(or (and (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 761#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1777#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)))), Black: 1772#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 178#true, 1549#true, Black: 1280#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (not (= ~y$r_buff0_thd1~0 0)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= (div ~y$r_buff0_thd1~0 256) 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0))), Black: 775#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 1252#true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 267#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1799#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (<= 0 (div ~y$r_buff1_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1292#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1290#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1293#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$mem_tmp~0 2) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0))), Black: 1288#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)), 1766#true, Black: 276#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 279#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ ~y$r_buff1_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd3~0)) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (= 2 ~y$w_buff0~0)), Black: 789#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1820#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1))) (= |#ghost~multithreaded| 0)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (= ~y$r_buff1_thd3~0 0)), 1827#true, Black: 1816#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= 0 (+ ~y$r_buff1_thd1~0 3)) (= ~y$mem_tmp~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 289#(and (or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1307#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0))), Black: 1304#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 800#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), 6#L776true, 4#$Ultimate##0true, Black: 302#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1329#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 296#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1844#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1832#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))), Black: 1846#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~x~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)))), Black: 830#(and (= 2 ~y$w_buff0~0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd3~0 256))) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (<= (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd3~0) ~y$r_buff1_thd3~0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1345#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), 166#true, Black: 841#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 1359#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), 495#(and (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= 0 (+ 2 ~__unbuffered_cnt~0)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1871#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= |#ghost~multithreaded| 0) (= ~y$w_buff0_used~0 1)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 854#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 8#P0EXITtrue, Black: 343#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 1)), Black: 1375#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1886#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) ~y$r_buff0_thd1~0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 1884#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) ~y$r_buff0_thd1~0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 869#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1))), Black: 365#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y~0 0) (= 2 ~y~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 361#(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) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 1932#true, Black: 360#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 364#(and (= ~y$r_buff0_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1)), 255#true, Black: 1390#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1904#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 888#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0)) (= |#ghost~multithreaded| 0)), Black: 381#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 380#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 379#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1924#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 1409#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= (+ ~y$w_buff0_used~0 1) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 394#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 903#(or (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1631#true, Black: 1431#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0))), Black: 1429#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 1940#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ ~y$r_buff1_thd3~0 1)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= (+ ~y$r_buff1_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 2) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1430#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 410#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 924#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1445#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff0_used~0 256))), Black: 423#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1580#true, Black: 435#(and (<= 1 ~y$w_buff0_used~0) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 436#(and (<= (div ~y$r_buff0_thd1~0 256) 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= ~y$r_buff1_thd1~0 0)), Black: 1460#(or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 1) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ ~y$r_buff0_thd3~0 1) (+ ~y$r_buff0_thd1~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))), Black: 954#(or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0_used~0 (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 449#(and (= ~x~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1475#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)), 1512#true, Black: 969#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 462#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1489#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0)), 1096#true, Black: 475#(and (= ~__unbuffered_p1_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 ~y$w_buff0_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 987#(or (and (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1502#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= (+ (* 256 (div ~y$w_buff1_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff1_used~0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= ~y$r_buff1_thd1~0 0)), Black: 1501#(and (<= 1 ~y$w_buff0_used~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 1500#(and (<= 1 ~y$w_buff0_used~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), 71#true, Black: 486#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 493#(and (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= 0 (+ 2 ~__unbuffered_cnt~0)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 487#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1005#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1614#true, Black: 1530#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd0~0) (+ (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1)), 293#true, Black: 508#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1))]) [2024-06-28 00:21:20,548 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-28 00:21:20,549 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-28 00:21:20,549 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-28 00:21:20,549 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-28 00:21:21,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L773-->L776: Formula: (= v_~y~0_3 1) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0][167], [Black: 1020#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 312#true, Black: 520#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 1547#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd3~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EBX~0 1)) (= |#ghost~multithreaded| 0))), Black: 532#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$w_buff0_used~0 ~y$r_buff1_thd1~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0)) (= |#ghost~multithreaded| 0)), Black: 1039#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p2_EBX~0 0)), 1565#true, Black: 1038#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p2_EBX~0 0)), 21#L852true, Black: 1559#(and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff0_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= 0 ~y$r_buff0_thd3~0) (= 2 ~y$w_buff0~0)), Black: 1555#(and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff0_used~0 0) (<= 0 ~y$r_buff0_thd3~0) (= 2 ~y$w_buff0~0)), 272#true, Black: 544#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (+ ~y$r_buff1_thd3~0 ~y$r_buff0_thd3~0)) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1058#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1572#(and (or (and (= ~y$w_buff1~0 0) (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1577#(and (= ~y$flush_delayed~0 0) (or (and (= ~y$w_buff1~0 0) (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (or (and (<= (+ 2 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 ~y$mem_tmp~0)) (= 2 ~__unbuffered_p2_EAX~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~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)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 55#(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) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1075#(and (= (div ~y$w_buff0_used~0 256) 0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 60#(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) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 575#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 1092#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)), Black: 589#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd1~0) (+ ~y$r_buff1_thd3~0 1)) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0))), Black: 86#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))), Black: 1105#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), 1206#true, Black: 1629#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$r_buff1_thd3~0 256))), 1879#true, 358#true, Black: 95#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))))) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 598#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)), Black: 613#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~x~0 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)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 1)), Black: 1122#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 623#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1138#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1664#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 2) (= 2 ~__unbuffered_p2_EAX~0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1152#(and (or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1153#(and (or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 636#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 635#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1676#(and (= 2 ~y$w_buff0~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$mem_tmp~0 2)) (= |#ghost~multithreaded| 0))), 1030#true, Black: 140#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~y~0 0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1167#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 656#(or (and (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1686#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$mem_tmp~0 2) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1182#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 673#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1704#(and (or (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 0) (= 2 ~y~0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$mem_tmp~0 2)) (= |#ghost~multithreaded| 0))), 100#true, 1158#true, Black: 171#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 170#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 172#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 1196#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1202#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1195#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1714#(and (= 2 ~y$w_buff0~0) (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 690#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 512#true, Black: 182#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), Black: 183#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), Black: 184#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), 1948#true, 1300#true, Black: 1214#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 704#(or (and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 1 ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 702#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 703#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 1 ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 194#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 196#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 1735#(and (or (and (= ~y$flush_delayed~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1_used~0 0) (= ~x~0 1)) (= |#ghost~multithreaded| 0))), Black: 1227#(or (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) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), 817#(or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))) (= |#ghost~multithreaded| 0)), Black: 209#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 720#(and (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1)), Black: 1761#(and (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1242#(or (and (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= (div ~y$r_buff0_thd1~0 256) 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0)) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff0_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)), Black: 1759#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 221#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1757#(and (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~x~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), Black: 736#(or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 1745#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 149#true, Black: 235#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= 2 ~y$w_buff0~0)), Black: 750#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~__unbuffered_p2_EBX~0 0) (<= (+ ~y$r_buff1_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= ~y$r_buff0_thd1~0 1) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256))), Black: 1257#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= 2 ~y~0)), Black: 1255#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0)), Black: 1256#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0)), Black: 1254#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1783#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0))), Black: 1785#(and (or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0))), Black: 1770#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1779#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 762#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 247#(or (and (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 761#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1777#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)))), Black: 1772#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 178#true, 1549#true, Black: 1280#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (not (= ~y$r_buff0_thd1~0 0)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= (div ~y$r_buff0_thd1~0 256) 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0))), Black: 775#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 1252#true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 267#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1799#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (<= 0 (div ~y$r_buff1_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1292#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1290#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1293#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$mem_tmp~0 2) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0))), Black: 1288#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)), 1766#true, Black: 276#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 279#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ ~y$r_buff1_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd3~0)) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (= 2 ~y$w_buff0~0)), Black: 789#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1820#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1))) (= |#ghost~multithreaded| 0)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (= ~y$r_buff1_thd3~0 0)), 1827#true, Black: 1816#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= 0 (+ ~y$r_buff1_thd1~0 3)) (= ~y$mem_tmp~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 289#(and (or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1307#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0))), Black: 1304#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 800#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), 6#L776true, 4#$Ultimate##0true, Black: 302#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1329#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 296#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1844#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1832#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))), Black: 1846#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~x~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)))), Black: 830#(and (= 2 ~y$w_buff0~0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd3~0 256))) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (<= (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd3~0) ~y$r_buff1_thd3~0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1345#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), 166#true, Black: 841#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 1359#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), 495#(and (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= 0 (+ 2 ~__unbuffered_cnt~0)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1871#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= |#ghost~multithreaded| 0) (= ~y$w_buff0_used~0 1)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 854#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 8#P0EXITtrue, Black: 343#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 1)), Black: 1375#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1886#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) ~y$r_buff0_thd1~0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 1884#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) ~y$r_buff0_thd1~0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 869#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1))), Black: 365#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y~0 0) (= 2 ~y~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 361#(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) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 1932#true, Black: 360#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 364#(and (= ~y$r_buff0_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1)), 255#true, Black: 1390#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1904#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 888#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0)) (= |#ghost~multithreaded| 0)), Black: 381#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 380#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 379#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1924#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 1409#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= (+ ~y$w_buff0_used~0 1) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 394#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 903#(or (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1631#true, Black: 1431#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0))), Black: 1429#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 1940#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ ~y$r_buff1_thd3~0 1)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= (+ ~y$r_buff1_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 2) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1430#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 410#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 924#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1445#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff0_used~0 256))), Black: 423#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1580#true, Black: 435#(and (<= 1 ~y$w_buff0_used~0) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 436#(and (<= (div ~y$r_buff0_thd1~0 256) 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= ~y$r_buff1_thd1~0 0)), Black: 1460#(or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 1) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ ~y$r_buff0_thd3~0 1) (+ ~y$r_buff0_thd1~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))), Black: 954#(or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0_used~0 (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 449#(and (= ~x~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1475#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)), 1512#true, Black: 969#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 462#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1489#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0)), 1096#true, Black: 475#(and (= ~__unbuffered_p1_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 ~y$w_buff0_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 987#(or (and (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1502#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= (+ (* 256 (div ~y$w_buff1_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff1_used~0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= ~y$r_buff1_thd1~0 0)), Black: 1501#(and (<= 1 ~y$w_buff0_used~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 1500#(and (<= 1 ~y$w_buff0_used~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), 71#true, Black: 486#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 493#(and (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= 0 (+ 2 ~__unbuffered_cnt~0)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 487#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1005#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1614#true, Black: 1530#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd0~0) (+ (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1)), 293#true, Black: 508#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1))]) [2024-06-28 00:21:21,130 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-28 00:21:21,130 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 00:21:21,130 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 00:21:21,130 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 00:21:21,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L791-->L806: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd3~0_98 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd3~0_104 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse3 .cse8)) (.cse10 (and .cse3 (= 0 (mod v_~y$w_buff1_used~0_155 256)))) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_174 256)))) (let ((.cse6 (or .cse1 .cse10 .cse11)) (.cse7 (and (not .cse11) .cse5)) (.cse4 (= (mod v_~y$w_buff1_used~0_154 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_72 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_173 256) 0))) (and (or (= v_~weak$$choice0~0_41 1) (= v_~weak$$choice0~0_41 0)) (= v_~y$w_buff0~0_74 v_~y$w_buff0~0_73) (= (ite .cse0 v_~y$r_buff0_thd3~0_104 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd3~0_104 (ite (and (not .cse2) .cse5) 0 v_~y$r_buff0_thd3~0_104))) v_~y$r_buff0_thd3~0_103) (= 0 v_~y$flush_delayed~0_53) (= v_~y~0_115 (ite .cse0 v_~y$mem_tmp~0_44 v_~__unbuffered_p2_EAX~0_14)) (= (ite .cse0 v_~y$w_buff0_used~0_174 (ite .cse6 v_~y$w_buff0_used~0_174 (ite .cse7 0 v_~y$w_buff0_used~0_174))) v_~y$w_buff0_used~0_173) (or (= v_~weak$$choice2~0_72 1) (= v_~weak$$choice2~0_72 0)) (= (ite .cse6 v_~y~0_117 (ite .cse7 v_~y$w_buff0~0_74 v_~y$w_buff1~0_81)) v_~__unbuffered_p2_EAX~0_14) (= v_~y$w_buff1~0_80 v_~y$w_buff1~0_81) (= v_~y~0_117 v_~y$mem_tmp~0_44) (= (ite .cse0 v_~y$r_buff1_thd3~0_98 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_103 256) 0))) (or (and .cse8 .cse9) .cse2 (and .cse9 .cse4))) v_~y$r_buff1_thd3~0_98 0)) v_~y$r_buff1_thd3~0_97) (= (ite .cse0 v_~y$w_buff1_used~0_155 (ite (or .cse1 .cse2 .cse10) v_~y$w_buff1_used~0_155 0)) v_~y$w_buff1_used~0_154))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_98, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff1~0=v_~y$w_buff1~0_81, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_74, ~y~0=v_~y~0_117, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_155} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_44, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_103, ~y$w_buff0~0=v_~y$w_buff0~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~y~0=v_~y~0_115, ~weak$$choice2~0=v_~weak$$choice2~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_154} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][416], [Black: 1020#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 312#true, Black: 520#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 1547#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd3~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EBX~0 1)) (= |#ghost~multithreaded| 0))), Black: 532#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$w_buff0_used~0 ~y$r_buff1_thd1~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0)) (= |#ghost~multithreaded| 0)), Black: 1039#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p2_EBX~0 0)), 1565#true, Black: 1038#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 1559#(and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff0_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= 0 ~y$r_buff0_thd3~0) (= 2 ~y$w_buff0~0)), Black: 1555#(and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff0_used~0 0) (<= 0 ~y$r_buff0_thd3~0) (= 2 ~y$w_buff0~0)), 272#true, Black: 544#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (+ ~y$r_buff1_thd3~0 ~y$r_buff0_thd3~0)) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1058#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1572#(and (or (and (= ~y$w_buff1~0 0) (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1577#(and (= ~y$flush_delayed~0 0) (or (and (= ~y$w_buff1~0 0) (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (or (and (<= (+ 2 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 ~y$mem_tmp~0)) (= 2 ~__unbuffered_p2_EAX~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~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)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 55#(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) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1075#(and (= (div ~y$w_buff0_used~0 256) 0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 60#(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) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 575#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 1092#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)), Black: 589#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd1~0) (+ ~y$r_buff1_thd3~0 1)) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0))), Black: 86#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))), Black: 1105#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), 1206#true, Black: 1629#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$r_buff1_thd3~0 256))), 1879#true, 358#true, Black: 95#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))))) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 598#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)), Black: 613#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~x~0 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)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 1)), Black: 1122#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 623#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1138#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1664#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 2) (= 2 ~__unbuffered_p2_EAX~0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1152#(and (or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1153#(and (or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 636#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 635#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1676#(and (= 2 ~y$w_buff0~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$mem_tmp~0 2)) (= |#ghost~multithreaded| 0))), 1030#true, Black: 140#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~y~0 0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1167#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 656#(or (and (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1686#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$mem_tmp~0 2) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1182#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 673#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1704#(and (or (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 0) (= 2 ~y~0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$mem_tmp~0 2)) (= |#ghost~multithreaded| 0))), 100#true, 1158#true, Black: 171#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 170#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 172#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 1196#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1202#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1195#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1714#(and (= 2 ~y$w_buff0~0) (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 690#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 31#L806true, 512#true, Black: 182#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), Black: 183#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), Black: 184#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), 1948#true, 1300#true, Black: 1214#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0)), 33#L851-5true, Black: 704#(or (and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 1 ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 702#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 703#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 1 ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 194#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 196#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 1735#(and (or (and (= ~y$flush_delayed~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1_used~0 0) (= ~x~0 1)) (= |#ghost~multithreaded| 0))), Black: 1227#(or (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) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 209#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 720#(and (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1)), Black: 1761#(and (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1242#(or (and (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= (div ~y$r_buff0_thd1~0 256) 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0)) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff0_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)), Black: 1759#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 221#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1757#(and (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~x~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), Black: 736#(or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 1745#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 149#true, Black: 235#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= 2 ~y$w_buff0~0)), Black: 750#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~__unbuffered_p2_EBX~0 0) (<= (+ ~y$r_buff1_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= ~y$r_buff0_thd1~0 1) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256))), Black: 1257#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= 2 ~y~0)), Black: 1255#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0)), Black: 1256#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0)), Black: 1254#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1783#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0))), Black: 1785#(and (or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0))), Black: 1770#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1779#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 762#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 247#(or (and (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 761#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1777#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)))), Black: 1772#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 178#true, 1549#true, Black: 1280#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (not (= ~y$r_buff0_thd1~0 0)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= (div ~y$r_buff0_thd1~0 256) 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0))), Black: 775#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 1252#true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 267#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1799#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (<= 0 (div ~y$r_buff1_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1292#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1290#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1293#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$mem_tmp~0 2) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0))), Black: 1288#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)), 1766#true, Black: 276#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 279#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ ~y$r_buff1_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd3~0)) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (= 2 ~y$w_buff0~0)), Black: 789#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1820#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1))) (= |#ghost~multithreaded| 0)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (= ~y$r_buff1_thd3~0 0)), 1827#true, Black: 1816#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= 0 (+ ~y$r_buff1_thd1~0 3)) (= ~y$mem_tmp~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 289#(and (or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1307#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0))), Black: 1304#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 800#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 817#(or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))) (= |#ghost~multithreaded| 0)), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1329#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 296#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1844#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1832#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))), Black: 1846#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~x~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)))), Black: 830#(and (= 2 ~y$w_buff0~0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd3~0 256))) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (<= (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd3~0) ~y$r_buff1_thd3~0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1345#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), 166#true, Black: 841#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 1359#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1871#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= |#ghost~multithreaded| 0) (= ~y$w_buff0_used~0 1)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 854#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 8#P0EXITtrue, Black: 343#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 1)), Black: 1375#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1886#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) ~y$r_buff0_thd1~0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 1884#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) ~y$r_buff0_thd1~0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 869#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1))), Black: 365#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y~0 0) (= 2 ~y~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 361#(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) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 1932#true, Black: 360#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 364#(and (= ~y$r_buff0_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1)), 255#true, Black: 1390#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1904#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 888#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0)) (= |#ghost~multithreaded| 0)), Black: 381#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 380#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 379#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1924#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 1409#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= (+ ~y$w_buff0_used~0 1) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 394#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 903#(or (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1631#true, Black: 1431#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0))), Black: 1429#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 1940#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ ~y$r_buff1_thd3~0 1)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= (+ ~y$r_buff1_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 2) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1430#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 410#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 924#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1445#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff0_used~0 256))), Black: 423#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1580#true, Black: 435#(and (<= 1 ~y$w_buff0_used~0) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 436#(and (<= (div ~y$r_buff0_thd1~0 256) 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= ~y$r_buff1_thd1~0 0)), Black: 1460#(or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 1) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ ~y$r_buff0_thd3~0 1) (+ ~y$r_buff0_thd1~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))), Black: 954#(or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0_used~0 (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))), 20#L773true, Black: 449#(and (= ~x~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1475#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)), 1512#true, Black: 969#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 462#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1489#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0)), 1096#true, Black: 475#(and (= ~__unbuffered_p1_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 ~y$w_buff0_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 987#(or (and (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1502#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= (+ (* 256 (div ~y$w_buff1_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff1_used~0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= ~y$r_buff1_thd1~0 0)), Black: 1501#(and (<= 1 ~y$w_buff0_used~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 1500#(and (<= 1 ~y$w_buff0_used~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), 71#true, Black: 486#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 493#(and (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= 0 (+ 2 ~__unbuffered_cnt~0)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 487#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1005#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1614#true, Black: 495#(and (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= 0 (+ 2 ~__unbuffered_cnt~0)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1530#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd0~0) (+ (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1)), 293#true, Black: 508#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1))]) [2024-06-28 00:21:21,674 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-28 00:21:21,674 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-28 00:21:21,674 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-28 00:21:21,674 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-28 00:21:21,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L791-->L806: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd3~0_98 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd3~0_104 256) 0))) (let ((.cse5 (not .cse3)) (.cse1 (and .cse3 .cse8)) (.cse10 (and .cse3 (= 0 (mod v_~y$w_buff1_used~0_155 256)))) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_174 256)))) (let ((.cse6 (or .cse1 .cse10 .cse11)) (.cse7 (and (not .cse11) .cse5)) (.cse4 (= (mod v_~y$w_buff1_used~0_154 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_72 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_173 256) 0))) (and (or (= v_~weak$$choice0~0_41 1) (= v_~weak$$choice0~0_41 0)) (= v_~y$w_buff0~0_74 v_~y$w_buff0~0_73) (= (ite .cse0 v_~y$r_buff0_thd3~0_104 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd3~0_104 (ite (and (not .cse2) .cse5) 0 v_~y$r_buff0_thd3~0_104))) v_~y$r_buff0_thd3~0_103) (= 0 v_~y$flush_delayed~0_53) (= v_~y~0_115 (ite .cse0 v_~y$mem_tmp~0_44 v_~__unbuffered_p2_EAX~0_14)) (= (ite .cse0 v_~y$w_buff0_used~0_174 (ite .cse6 v_~y$w_buff0_used~0_174 (ite .cse7 0 v_~y$w_buff0_used~0_174))) v_~y$w_buff0_used~0_173) (or (= v_~weak$$choice2~0_72 1) (= v_~weak$$choice2~0_72 0)) (= (ite .cse6 v_~y~0_117 (ite .cse7 v_~y$w_buff0~0_74 v_~y$w_buff1~0_81)) v_~__unbuffered_p2_EAX~0_14) (= v_~y$w_buff1~0_80 v_~y$w_buff1~0_81) (= v_~y~0_117 v_~y$mem_tmp~0_44) (= (ite .cse0 v_~y$r_buff1_thd3~0_98 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_103 256) 0))) (or (and .cse8 .cse9) .cse2 (and .cse9 .cse4))) v_~y$r_buff1_thd3~0_98 0)) v_~y$r_buff1_thd3~0_97) (= (ite .cse0 v_~y$w_buff1_used~0_155 (ite (or .cse1 .cse2 .cse10) v_~y$w_buff1_used~0_155 0)) v_~y$w_buff1_used~0_154))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_98, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff1~0=v_~y$w_buff1~0_81, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_74, ~y~0=v_~y~0_117, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_155} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_44, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_103, ~y$w_buff0~0=v_~y$w_buff0~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~y~0=v_~y~0_115, ~weak$$choice2~0=v_~weak$$choice2~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_154} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][416], [Black: 1020#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 312#true, Black: 520#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 1547#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd3~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EBX~0 1)) (= |#ghost~multithreaded| 0))), Black: 532#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$w_buff0_used~0 ~y$r_buff1_thd1~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0)) (= |#ghost~multithreaded| 0)), Black: 1039#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p2_EBX~0 0)), 1565#true, Black: 1038#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p2_EBX~0 0)), 21#L852true, Black: 1559#(and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff0_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= 0 ~y$r_buff0_thd3~0) (= 2 ~y$w_buff0~0)), Black: 1555#(and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff0_used~0 0) (<= 0 ~y$r_buff0_thd3~0) (= 2 ~y$w_buff0~0)), 272#true, Black: 544#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (+ ~y$r_buff1_thd3~0 ~y$r_buff0_thd3~0)) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1058#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1572#(and (or (and (= ~y$w_buff1~0 0) (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1577#(and (= ~y$flush_delayed~0 0) (or (and (= ~y$w_buff1~0 0) (= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (or (and (<= (+ 2 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 ~y$mem_tmp~0)) (= 2 ~__unbuffered_p2_EAX~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 552#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 564#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~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)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 55#(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) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1075#(and (= (div ~y$w_buff0_used~0 256) 0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 60#(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) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 575#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 1092#(and (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)), Black: 589#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd1~0) (+ ~y$r_buff1_thd3~0 1)) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0))), Black: 86#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))), Black: 1105#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), 1206#true, Black: 1629#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$r_buff1_thd3~0 256))), 1879#true, 358#true, Black: 95#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))))) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 598#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)), Black: 613#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~x~0 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)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 1)), Black: 1122#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 623#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1138#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1664#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 2) (= 2 ~__unbuffered_p2_EAX~0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1152#(and (or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1153#(and (or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 636#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 635#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1676#(and (= 2 ~y$w_buff0~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$mem_tmp~0 2)) (= |#ghost~multithreaded| 0))), 1030#true, Black: 140#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~y~0 0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1167#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 656#(or (and (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1686#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$mem_tmp~0 2) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1182#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 673#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1704#(and (or (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 0) (= 2 ~y~0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$mem_tmp~0 2)) (= |#ghost~multithreaded| 0))), 100#true, 1158#true, Black: 171#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 170#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 172#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 1196#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1202#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1195#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1714#(and (= 2 ~y$w_buff0~0) (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 690#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 31#L806true, 512#true, Black: 182#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), Black: 183#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), Black: 184#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1)), 1948#true, 1300#true, Black: 1214#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 704#(or (and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 1 ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 702#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 703#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 1 ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 194#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 196#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 1735#(and (or (and (= ~y$flush_delayed~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1_used~0 0) (= ~x~0 1)) (= |#ghost~multithreaded| 0))), Black: 1227#(or (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) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 209#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1)), Black: 720#(and (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1)), Black: 1761#(and (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1242#(or (and (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= (div ~y$r_buff0_thd1~0 256) 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0)) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff0_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)), Black: 1759#(and (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 221#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1757#(and (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (or (and (= ~x~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), Black: 736#(or (= |#ghost~multithreaded| 0) (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 1745#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 149#true, Black: 235#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= 2 ~y$w_buff0~0)), Black: 750#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~__unbuffered_p2_EBX~0 0) (<= (+ ~y$r_buff1_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= ~y$r_buff0_thd1~0 1) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256))), Black: 1257#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= 2 ~y~0)), Black: 1255#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0)), Black: 1256#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0)), Black: 1254#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1783#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0))), Black: 1785#(and (or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1)) (= |#ghost~multithreaded| 0))), Black: 1770#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1779#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 762#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 247#(or (and (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 761#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1777#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)))), Black: 1772#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0 3)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (= ~y$read_delayed~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 178#true, 1549#true, Black: 1280#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (not (= ~y$r_buff0_thd1~0 0)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= (div ~y$r_buff0_thd1~0 256) 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0))), Black: 775#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 1252#true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 267#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1799#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (<= 0 (div ~y$r_buff1_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1292#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1290#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1293#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$mem_tmp~0 2) (= ~y$read_delayed~0 0) (= 2 ~__unbuffered_p2_EAX~0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0))), Black: 1288#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0)), 1766#true, Black: 276#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 279#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ ~y$r_buff1_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd3~0)) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (= 2 ~y$w_buff0~0)), Black: 789#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1820#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1))) (= |#ghost~multithreaded| 0)) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (= ~y$r_buff1_thd3~0 0)), 1827#true, Black: 1816#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (<= 0 (+ ~y$r_buff1_thd1~0 3)) (= ~y$mem_tmp~0 0) (<= ~y$r_buff1_thd1~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 289#(and (or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1307#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0))), Black: 1304#(and (or (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (< ~y$w_buff0_used~0 (+ (* 256 (div ~y$w_buff0_used~0 256)) 1))) (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 800#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 817#(or (and (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (not (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0))) (= |#ghost~multithreaded| 0)), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1329#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 296#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1844#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))) (or (and (= ~y$flush_delayed~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1832#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))), Black: 1846#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 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_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$w_buff0_used~0 1))) (or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~x~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)))), Black: 830#(and (= 2 ~y$w_buff0~0) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd3~0 256))) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (<= (+ (* 256 (div ~y$r_buff1_thd3~0 256)) ~y$r_buff0_thd3~0) ~y$r_buff1_thd3~0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 1345#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), 166#true, Black: 841#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 1359#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1871#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))) (or (= |#ghost~multithreaded| 0) (= ~y$w_buff0_used~0 1)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (or (and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 1) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 854#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 8#P0EXITtrue, Black: 343#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)), Black: 355#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (or (and (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~y~0 1) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 1)), Black: 1375#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1886#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) ~y$r_buff0_thd1~0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 1884#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) ~y$r_buff0_thd1~0) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= 2 ~y$w_buff0~0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 869#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1))), Black: 365#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (= ~y~0 0) (= 2 ~y~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd0~0 0)), Black: 361#(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) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 1932#true, Black: 360#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 364#(and (= ~y$r_buff0_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (div ~y$w_buff0_used~0 256) 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (not (= ~y$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1)), 255#true, Black: 1390#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1904#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 888#(or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0)) (= |#ghost~multithreaded| 0)), Black: 381#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 380#(and (= ~__unbuffered_p1_EAX~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 379#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1924#(or (= |#ghost~multithreaded| 0) (and (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= ~y$read_delayed~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))), Black: 1409#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= (+ ~y$w_buff0_used~0 1) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 394#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 903#(or (and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1631#true, Black: 1431#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= (+ ~y$r_buff1_thd1~0 1) ~y$r_buff0_thd1~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0))), Black: 1429#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 1940#(or (and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd1~0 (+ ~y$r_buff1_thd3~0 1)) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= (+ ~y$r_buff1_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~__unbuffered_p2_EBX~0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 2) (<= (+ ~y$r_buff0_thd3~0 1) ~y$r_buff0_thd1~0) (<= ~y$r_buff0_thd1~0 1) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)), Black: 1430#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd1~0 1) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 410#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 924#(and (or (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= ~y$r_buff1_thd3~0 ~y$w_buff0_used~0) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (<= (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff1_thd3~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 1445#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff0_used~0 256))), Black: 423#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1580#true, Black: 435#(and (<= 1 ~y$w_buff0_used~0) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), Black: 436#(and (<= (div ~y$r_buff0_thd1~0 256) 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= ~y$r_buff1_thd1~0 0)), Black: 1460#(or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 1) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ ~y$r_buff0_thd3~0 1) (+ ~y$r_buff0_thd1~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))), Black: 954#(or (= |#ghost~multithreaded| 0) (and (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff0_used~0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0_used~0 (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))), 20#L773true, Black: 449#(and (= ~x~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1475#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)), 1512#true, Black: 969#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 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_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 462#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1489#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ ~y$w_buff0_used~0 1)) (= ~__unbuffered_p2_EBX~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) 1) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff0_used~0 256))) ~y$w_buff0_used~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$mem_tmp~0 0)), 1096#true, Black: 475#(and (= ~__unbuffered_p1_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff1_thd3~0 0) (<= 0 ~y$w_buff0_used~0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 987#(or (and (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd3~0 (+ (* (div ~y$r_buff0_thd3~0 256) 256) 1)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 2)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= ~y$r_buff1_thd3~0 (+ (* 256 (div ~y$r_buff1_thd3~0 256)) 1)) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1502#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= (+ (* 256 (div ~y$w_buff1_used~0 256)) ~y$r_buff0_thd3~0) ~y$w_buff1_used~0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0) (= 2 ~y~0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256)))))) (= ~y$r_buff1_thd1~0 0)), Black: 1501#(and (<= 1 ~y$w_buff0_used~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), Black: 1500#(and (<= 1 ~y$w_buff0_used~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y$r_buff1_thd1~0 0)), 71#true, Black: 486#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 493#(and (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= 0 (+ 2 ~__unbuffered_cnt~0)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 487#(and (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1005#(or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (<= ~y$flush_delayed~0 (* (div ~y$flush_delayed~0 256) 256)) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$mem_tmp~0 0) (<= 0 (div ~y$r_buff1_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1614#true, Black: 495#(and (= ~y$w_buff1~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 2)) (<= 0 (+ 2 ~y~0)) (<= ~y$r_buff0_thd0~0 (+ 2 (* 256 (div ~y$r_buff0_thd0~0 256)))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$w_buff0_used~0)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 2)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (<= (+ ~y$r_buff1_thd2~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0) (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff1_thd3~0 (+ 2 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 3)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~y~0)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd2~0) (+ (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$w_buff0_used~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1) ~y$r_buff0_thd1~0) (<= (+ ~y$r_buff1_thd3~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd3~0 256)))) (<= 0 (+ 2 ~__unbuffered_cnt~0)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 2)) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$flush_delayed~0) (+ (* (div ~y$flush_delayed~0 256) 256) ~y$w_buff0_used~0)) (<= ~y$r_buff0_thd3~0 (+ 2 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd1~0) (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$w_buff0_used~0 1)) (<= (* 256 (div ~y$w_buff0_used~0 256)) (+ ~y$w_buff0_used~0 ~__unbuffered_cnt~0)) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 2)) (<= (+ ~y$r_buff1_thd0~0 (* 256 (div ~y$w_buff0_used~0 256))) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd3~0) (+ ~y$w_buff0_used~0 (* (div ~y$r_buff0_thd3~0 256) 256))) (<= (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$w_buff1_used~0) (+ ~y$r_buff1_thd1~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$r_buff1_thd0~0 (+ 2 (* 256 (div ~y$r_buff1_thd0~0 256)))) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$r_buff0_thd0~0) (+ ~y$w_buff0_used~0 (* 256 (div ~y$r_buff0_thd0~0 256))))) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1530#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd3~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd0~0) (+ (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd1~0)) (= ~y$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff1_used~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd1~0) (+ (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff0_thd1~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~y$w_buff0~0 0) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff1_thd2~0) (+ (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff0_thd1~0)) (<= (+ (* (div ~y$r_buff0_thd1~0 256) 256) ~y$read_delayed~0) (+ (* 256 (div ~y$read_delayed~0 256)) ~y$r_buff0_thd1~0)) (<= ~y$r_buff0_thd1~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1)), 293#true, Black: 508#(and (or (and (= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 1))]) [2024-06-28 00:21:21,676 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-28 00:21:21,676 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 00:21:21,676 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 00:21:21,676 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 00:21:23,017 INFO L124 PetriNetUnfolderBase]: 6886/10764 cut-off events. [2024-06-28 00:21:23,017 INFO L125 PetriNetUnfolderBase]: For 1263361/1263485 co-relation queries the response was YES. [2024-06-28 00:21:23,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92246 conditions, 10764 events. 6886/10764 cut-off events. For 1263361/1263485 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 71076 event pairs, 1948 based on Foata normal form. 75/10794 useless extension candidates. Maximal degree in co-relation 92021. Up to 10165 conditions per place. [2024-06-28 00:21:23,544 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 987 selfloop transitions, 130 changer transitions 0/1210 dead transitions. [2024-06-28 00:21:23,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 1210 transitions, 23889 flow [2024-06-28 00:21:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:21:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:21:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-28 00:21:23,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-28 00:21:23,545 INFO L175 Difference]: Start difference. First operand has 517 places, 1187 transitions, 21491 flow. Second operand 8 states and 128 transitions. [2024-06-28 00:21:23,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 1210 transitions, 23889 flow [2024-06-28 00:21:28,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 1210 transitions, 23605 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-28 00:21:29,002 INFO L231 Difference]: Finished difference. Result has 519 places, 1193 transitions, 21616 flow [2024-06-28 00:21:29,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21207, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=21616, PETRI_PLACES=519, PETRI_TRANSITIONS=1193} [2024-06-28 00:21:29,003 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 478 predicate places. [2024-06-28 00:21:29,003 INFO L495 AbstractCegarLoop]: Abstraction has has 519 places, 1193 transitions, 21616 flow [2024-06-28 00:21:29,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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:21:29,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:29,003 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:21:29,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-28 00:21:29,003 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:29,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash -845269360, now seen corresponding path program 4 times [2024-06-28 00:21:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:29,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346363771] [2024-06-28 00:21:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:30,997 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:21:30,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346363771] [2024-06-28 00:21:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346363771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:21:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098365618] [2024-06-28 00:21:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:30,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:21:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:21:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:21:31,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:21:31,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 1193 transitions, 21616 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:21:31,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:31,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:21:31,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:35,114 INFO L124 PetriNetUnfolderBase]: 7121/11088 cut-off events. [2024-06-28 00:21:35,114 INFO L125 PetriNetUnfolderBase]: For 1270472/1270476 co-relation queries the response was YES. [2024-06-28 00:21:35,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95196 conditions, 11088 events. 7121/11088 cut-off events. For 1270472/1270476 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 72731 event pairs, 2444 based on Foata normal form. 16/11104 useless extension candidates. Maximal degree in co-relation 94969. Up to 10640 conditions per place. [2024-06-28 00:21:35,354 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 1101 selfloop transitions, 141 changer transitions 0/1245 dead transitions. [2024-06-28 00:21:35,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 1245 transitions, 24707 flow [2024-06-28 00:21:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:21:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:21:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2024-06-28 00:21:35,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2024-06-28 00:21:35,355 INFO L175 Difference]: Start difference. First operand has 519 places, 1193 transitions, 21616 flow. Second operand 9 states and 139 transitions. [2024-06-28 00:21:35,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 1245 transitions, 24707 flow [2024-06-28 00:21:40,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 1245 transitions, 24513 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-06-28 00:21:40,524 INFO L231 Difference]: Finished difference. Result has 525 places, 1218 transitions, 22185 flow [2024-06-28 00:21:40,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21421, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=22185, PETRI_PLACES=525, PETRI_TRANSITIONS=1218} [2024-06-28 00:21:40,524 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 484 predicate places. [2024-06-28 00:21:40,524 INFO L495 AbstractCegarLoop]: Abstraction has has 525 places, 1218 transitions, 22185 flow [2024-06-28 00:21:40,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:21:40,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:40,524 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:21:40,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-28 00:21:40,525 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:40,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash -668137840, now seen corresponding path program 5 times [2024-06-28 00:21:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:40,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533254611] [2024-06-28 00:21:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:42,637 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:21:42,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:42,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533254611] [2024-06-28 00:21:42,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533254611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:42,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:42,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:21:42,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532824807] [2024-06-28 00:21:42,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:42,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:21:42,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:42,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:21:42,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:21:42,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:21:42,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 1218 transitions, 22185 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:21:42,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:42,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:21:42,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:47,115 INFO L124 PetriNetUnfolderBase]: 7277/11304 cut-off events. [2024-06-28 00:21:47,115 INFO L125 PetriNetUnfolderBase]: For 1310965/1310969 co-relation queries the response was YES. [2024-06-28 00:21:47,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98575 conditions, 11304 events. 7277/11304 cut-off events. For 1310965/1310969 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 74162 event pairs, 2429 based on Foata normal form. 10/11314 useless extension candidates. Maximal degree in co-relation 98347. Up to 10779 conditions per place. [2024-06-28 00:21:47,339 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 1108 selfloop transitions, 175 changer transitions 0/1286 dead transitions. [2024-06-28 00:21:47,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 1286 transitions, 25825 flow [2024-06-28 00:21:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:21:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:21:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2024-06-28 00:21:47,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3775 [2024-06-28 00:21:47,340 INFO L175 Difference]: Start difference. First operand has 525 places, 1218 transitions, 22185 flow. Second operand 10 states and 151 transitions. [2024-06-28 00:21:47,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 1286 transitions, 25825 flow [2024-06-28 00:21:53,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 1286 transitions, 25529 flow, removed 80 selfloop flow, removed 4 redundant places. [2024-06-28 00:21:53,634 INFO L231 Difference]: Finished difference. Result has 532 places, 1257 transitions, 23022 flow [2024-06-28 00:21:53,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21966, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23022, PETRI_PLACES=532, PETRI_TRANSITIONS=1257} [2024-06-28 00:21:53,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 491 predicate places. [2024-06-28 00:21:53,635 INFO L495 AbstractCegarLoop]: Abstraction has has 532 places, 1257 transitions, 23022 flow [2024-06-28 00:21:53,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:21:53,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:53,636 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:21:53,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-28 00:21:53,636 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:53,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1267539935, now seen corresponding path program 1 times [2024-06-28 00:21:53,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:53,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408030992] [2024-06-28 00:21:53,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:53,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:55,896 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:21:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408030992] [2024-06-28 00:21:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408030992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:21:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411512035] [2024-06-28 00:21:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:55,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:21:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:55,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:21:55,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:21:55,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:21:55,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 1257 transitions, 23022 flow. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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:21:55,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:55,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:21:55,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:00,729 INFO L124 PetriNetUnfolderBase]: 7305/11339 cut-off events. [2024-06-28 00:22:00,729 INFO L125 PetriNetUnfolderBase]: For 1313087/1313091 co-relation queries the response was YES. [2024-06-28 00:22:00,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100023 conditions, 11339 events. 7305/11339 cut-off events. For 1313087/1313091 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 74146 event pairs, 2511 based on Foata normal form. 6/11345 useless extension candidates. Maximal degree in co-relation 99794. Up to 11059 conditions per place. [2024-06-28 00:22:00,924 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 1243 selfloop transitions, 48 changer transitions 0/1294 dead transitions. [2024-06-28 00:22:00,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 1294 transitions, 26199 flow [2024-06-28 00:22:00,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:22:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:22:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-28 00:22:00,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-28 00:22:00,926 INFO L175 Difference]: Start difference. First operand has 532 places, 1257 transitions, 23022 flow. Second operand 8 states and 120 transitions. [2024-06-28 00:22:00,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 1294 transitions, 26199 flow [2024-06-28 00:22:06,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 1294 transitions, 25929 flow, removed 77 selfloop flow, removed 5 redundant places. [2024-06-28 00:22:06,111 INFO L231 Difference]: Finished difference. Result has 536 places, 1272 transitions, 23103 flow [2024-06-28 00:22:06,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=22752, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=23103, PETRI_PLACES=536, PETRI_TRANSITIONS=1272} [2024-06-28 00:22:06,112 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 495 predicate places. [2024-06-28 00:22:06,112 INFO L495 AbstractCegarLoop]: Abstraction has has 536 places, 1272 transitions, 23103 flow [2024-06-28 00:22:06,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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:22:06,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:06,112 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:22:06,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-28 00:22:06,113 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:06,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -658101522, now seen corresponding path program 6 times [2024-06-28 00:22:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:06,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283342018] [2024-06-28 00:22:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:07,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:22:07,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:07,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283342018] [2024-06-28 00:22:07,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283342018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:07,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:07,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:22:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398145471] [2024-06-28 00:22:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:22:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:22:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:22:07,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:22:07,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 1272 transitions, 23103 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:22:07,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:07,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:22:07,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:12,627 INFO L124 PetriNetUnfolderBase]: 7327/11381 cut-off events. [2024-06-28 00:22:12,627 INFO L125 PetriNetUnfolderBase]: For 1336634/1336638 co-relation queries the response was YES. [2024-06-28 00:22:12,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100198 conditions, 11381 events. 7327/11381 cut-off events. For 1336634/1336638 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 74686 event pairs, 2458 based on Foata normal form. 2/11383 useless extension candidates. Maximal degree in co-relation 99966. Up to 10833 conditions per place. [2024-06-28 00:22:12,842 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 1142 selfloop transitions, 169 changer transitions 0/1314 dead transitions. [2024-06-28 00:22:12,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 1314 transitions, 26587 flow [2024-06-28 00:22:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:22:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:22:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-28 00:22:12,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-28 00:22:12,844 INFO L175 Difference]: Start difference. First operand has 536 places, 1272 transitions, 23103 flow. Second operand 8 states and 126 transitions. [2024-06-28 00:22:12,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 1314 transitions, 26587 flow [2024-06-28 00:22:18,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 1314 transitions, 26481 flow, removed 40 selfloop flow, removed 3 redundant places. [2024-06-28 00:22:18,867 INFO L231 Difference]: Finished difference. Result has 542 places, 1288 transitions, 23661 flow [2024-06-28 00:22:18,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=22997, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=23661, PETRI_PLACES=542, PETRI_TRANSITIONS=1288} [2024-06-28 00:22:18,867 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 501 predicate places. [2024-06-28 00:22:18,868 INFO L495 AbstractCegarLoop]: Abstraction has has 542 places, 1288 transitions, 23661 flow [2024-06-28 00:22:18,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:22:18,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:18,868 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:22:18,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-28 00:22:18,868 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:18,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1080234278, now seen corresponding path program 7 times [2024-06-28 00:22:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792793745] [2024-06-28 00:22:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:20,411 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:22:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792793745] [2024-06-28 00:22:20,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792793745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:20,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:20,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:22:20,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422753306] [2024-06-28 00:22:20,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:20,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:22:20,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:22:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:22:20,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:22:20,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 1288 transitions, 23661 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:22:20,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:20,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:22:20,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:25,305 INFO L124 PetriNetUnfolderBase]: 7332/11375 cut-off events. [2024-06-28 00:22:25,305 INFO L125 PetriNetUnfolderBase]: For 1352866/1352870 co-relation queries the response was YES. [2024-06-28 00:22:25,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101019 conditions, 11375 events. 7332/11375 cut-off events. For 1352866/1352870 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 74450 event pairs, 2505 based on Foata normal form. 5/11380 useless extension candidates. Maximal degree in co-relation 100785. Up to 11142 conditions per place. [2024-06-28 00:22:25,532 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 1269 selfloop transitions, 32 changer transitions 0/1304 dead transitions. [2024-06-28 00:22:25,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 1304 transitions, 26365 flow [2024-06-28 00:22:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:22:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:22:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2024-06-28 00:22:25,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2024-06-28 00:22:25,534 INFO L175 Difference]: Start difference. First operand has 542 places, 1288 transitions, 23661 flow. Second operand 7 states and 106 transitions. [2024-06-28 00:22:25,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 1304 transitions, 26365 flow [2024-06-28 00:22:30,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 1304 transitions, 26117 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-28 00:22:30,972 INFO L231 Difference]: Finished difference. Result has 545 places, 1292 transitions, 23545 flow [2024-06-28 00:22:30,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=23415, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=23545, PETRI_PLACES=545, PETRI_TRANSITIONS=1292} [2024-06-28 00:22:30,973 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 504 predicate places. [2024-06-28 00:22:30,973 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 1292 transitions, 23545 flow [2024-06-28 00:22:30,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:22:30,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:30,974 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:22:30,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-28 00:22:30,974 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:30,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:30,974 INFO L85 PathProgramCache]: Analyzing trace with hash -657981552, now seen corresponding path program 8 times [2024-06-28 00:22:30,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:30,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274132447] [2024-06-28 00:22:30,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:30,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:33,192 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:22:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274132447] [2024-06-28 00:22:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274132447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:22:33,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686799704] [2024-06-28 00:22:33,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:33,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:22:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:22:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:22:33,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-28 00:22:33,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 1292 transitions, 23545 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:22:33,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:33,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-28 00:22:33,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:37,926 INFO L124 PetriNetUnfolderBase]: 7326/11373 cut-off events. [2024-06-28 00:22:37,926 INFO L125 PetriNetUnfolderBase]: For 1368670/1368674 co-relation queries the response was YES. [2024-06-28 00:22:38,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100521 conditions, 11373 events. 7326/11373 cut-off events. For 1368670/1368674 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 74510 event pairs, 2477 based on Foata normal form. 8/11381 useless extension candidates. Maximal degree in co-relation 100286. Up to 11034 conditions per place. [2024-06-28 00:22:38,259 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 1204 selfloop transitions, 104 changer transitions 0/1311 dead transitions. [2024-06-28 00:22:38,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 1311 transitions, 26315 flow [2024-06-28 00:22:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:22:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:22:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-28 00:22:38,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-28 00:22:38,260 INFO L175 Difference]: Start difference. First operand has 545 places, 1292 transitions, 23545 flow. Second operand 8 states and 118 transitions. [2024-06-28 00:22:38,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 1311 transitions, 26315 flow